This was an on-campus process with two rounds on the same schedule. First I got a simple dynamic-programming question about counting ways to reach a target count. The second round shifted to scheduling algorithms: FCFS, SJF, and round-robin.
They were not presented as trick questions. I felt reasonably comfortable with both the DP logic and the scheduler implementations.
I did not get an offer. My reflection was that the interviewers were testing correctness and implementation detail, and that was likely where I fell short.
Location: Bengaluru. Overall feedback: neutral. Offer status: no offer.
Discussion
Loading comments…