Had the beggining of the call with OS fundamentals on thread vs process, process synchronisation and the screening 2 Leetcode questions - 1 easy on Tree and 1 Difficult on backracing
Interviewed for an SDE role. The process was well-organized and the recruiters were responsive throughout. That said, the technical rounds were significantly more challenging than expected — definitely come prepared to go deep. Overall a valuable experience regardless of the outcome.
That was a real stroke of luck — when I got to the coding round and encountered a question on finding the maximum subarray sum, I had literally seen this exact problem on prachub.com a few days earlier. The interview kicked off with a recruiter screen, followed by a technical phone interview. It was intense, especially with the focus on algorithms and data structures. I also faced some behavioral questions that challenged my experience. After a final onsite round, I received an offer and happily accepted. Overall, it was tough but rewarding.
Interview questions [1]
Question 1
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Overall, a good interview process and the team were very friendly during the interview process and it was very good and pleasant. Nothing in regard to negative feedback or anything as such like that.
Top companies for "Compensation and Benefits" near you
