The recruiter contacted me, we arranged to talk at a specific time and day. She didn't call, a day later I contacted her and we set another date. Even at the new date, she did not make contact.
I applied online. I interviewed at webiks (Tel Aviv-Yafo) in Jul 2024
Interview
1. **Home Test**: A practical assessment to evaluate coding skills, problem-solving abilities, and familiarity with relevant technologies and frameworks, often involving real-world scenarios related to the job role.
2. **Technical Questions about My Projects**: Detailed inquiries into the projects I've worked on, focusing on the architecture, technologies used, challenges faced, and solutions implemented, to assess my technical expertise and experience.
3. **Design Chat System**: An exercise or discussion focused on designing a chat system, covering aspects such as system architecture, data flow, scalability, security, and user experience considerations.
4. **HackerRank Questions**: Coding challenges and algorithm problems on the HackerRank platform, designed to test my problem-solving skills, coding efficiency, and ability to write clean and optimized code.
5. **HR Interview**: A conversation with a Human Resources representative to evaluate my cultural fit, communication skills, career aspirations, and understanding of the company's values and work environment.
6. **CEO Interview**: A high-level discussion with the CEO to assess my overall fit within the organization, my vision and goals, leadership potential, and how I can contribute to the company's long-term success.
Interview questions [1]
Question 1
Implement sum operation with recursion for binary tree
I applied online. The process took 2 days. I interviewed at webiks (Tel Aviv-Yafo) in Jan 2024
Interview
The first process of the interview is a home assignment with 90 minutes to solve it.
The assignment contains 3 challenging but not so difficult questions. The task is been solved through HackerRank and the platform is very convinient
Interview questions [1]
Question 1
given an array of integers, without reordering, determine the maximum difference between any element and prior smaller element. If there is never a lower prior element, return -1.
example
arr = [5,3,6,7,4]
there are no earlier elements than arr[0].
there is no earlier reading with a value lower than arr[1].
there are two lower earlier readings with a value lower than arr[2]=6:
• arr[2] - arr[1] = 6 - 3 = 3
• arr[2] - arr[0] = 6 - 5 = 1
there are three lower earlier readings with a lower value than arr[3]=7:
• arr[3] - arr[2] = 7 - 6 = 1
• arr[3] - arr[1] = 7 - 3 =4
• arr[3] - arr[0] = 7 - 5 =2
there is one lower earlier reading with a lower value than arr[4]=4:
• arr[4] - arr[1] = 4 - 3 = 1
the maximum trailing record is arr[3] - arr[1] = 4