Competition is crazily tough but achievable.
Competition is healthy, but that creates a bit too much, Rufus!
I applied through campus and successfully solved both questions in the OA. The interview consisted of two rounds: * One round was DSA completely. * The other round was DSA + HR. Topics asked included trees, dynamic programming, greedy algorith
The interviewer was friendly. The interview started with a simple introduction. Following this, I was asked to explain the logic/thought process and code a DSA problem on a monotonic stack. Approximately 35-40 minutes were allocated for this task.
They started with an Oops (object-oriented programming) and DBMS question. The Oops topic was asked in detail. One SQL query was added, then one easy to medium DSA (data structures and algorithms) question. I proceeded to round 2 of the interview. It
I applied through campus and successfully solved both questions in the OA. The interview consisted of two rounds: * One round was DSA completely. * The other round was DSA + HR. Topics asked included trees, dynamic programming, greedy algorith
The interviewer was friendly. The interview started with a simple introduction. Following this, I was asked to explain the logic/thought process and code a DSA problem on a monotonic stack. Approximately 35-40 minutes were allocated for this task.
They started with an Oops (object-oriented programming) and DBMS question. The Oops topic was asked in detail. One SQL query was added, then one easy to medium DSA (data structures and algorithms) question. I proceeded to round 2 of the interview. It