4 coding interview steps, plus another talk with the manager. A bit challenging for a University Graduate, however, it is doable. There is also a simple coding exercise when you apply to check for your frontend knowledge, but it is fairly simple.
1st round - adding multiplication function to C codebase
2nd round - 2 1-hour technical interviews. interviewers ghosted and had to reschedule multiple times. didn't apologize, very unprofessional vibe.
Got rejected, asked recruiters for any feedback even if it was vague, but they ghosted as well. bad experience overall.
Interview questions [1]
Question 1
- Find indices of elements for 2-sum, 3-sum, and 4-sum all in optimal time. 2-sum is easy, but 3-sum and 4-sum should be O(n^2) which is tricky because you need to find indices, not just the elements and there can be duplicate elements. Still don't understand solution to this day
- Connect next pointers of all leaf nodes in binary tree. Tricky part is you must do it without extra space so you can't create a queue. I solved using a queue at first and thought solving without extra space was just a followup but I got rejected so seems like you have to do optimal space or else you'll get no hire.
