I applied online. The process took 2 weeks. I interviewed at Radware (Tel Aviv-Yafo) in Nov 2019
Interview
Stage 1: Short phone interview with a recruiter who ask few questions about my availability, university background and my salary expectations(they tend to offer 80-90 NIS per hour).
Stage 2: I was invited to on-site 1:1 interview with a team leader who asked me several technical questions. The interviewer was very nice and friendly and the atmosphere over the interview was pleasent.
Stage 3: After I passed the first interview I was invited to on-site 2:1 interview with two engineers. They both were very nice and friendly. I was asked two design-based questions.
Stage 4: The final stage is a HR interview, but I received an offer from other company so I ended the process earlier that interview.
The engineers and the team leader were very friendly and the interviews conducted in pleasent atmosphere but the place feels like old-fashion workplace and not like a tempting HiTech company, in my opinion at least.
Interview questions [7]
Question 1
1st interview: The classic two-sum question. write a function that receive an array of integers and a target value, and returns the indexes i,j such that array[i] + array[j] = target(if they're exist)
1st interview: write a function that receive a linked list of length n and an integer k, that returns the val of the node located k steps from the end with only one pass over the list (you can assume k < n)
1st interview: follow up question of the previous one- write a function that receives a binary tree and prints the values of the first level from left to right, the next level from right to left, the next level from left to right and so on..
1st interview: right a function that receive an array of integers such that every element in the array, except one, appears even number of times. you should find the one element who appears odd number of times. the solution should be in O(n) runtime complexity and O(1) memory complexity
2nd interview: memory managment- you have 1M of memory bytes and you should write a class the overrides malloc and free functions, which allocate n bytes for each call of "malloc" and free every pointer for each call of "free(ptr)" in O(1) for both functions. (you can do preprocessing)