Flipkart

He had clearly stated that this could be done using a normal sorting algorithm in O(n log n), but I had to provide a more optimized solution. I proposed a solution using a stack, which somehow worked for the test case he gave me. However, he proved

Round 1 started with 3 questions. All of them were from DP, and one of the questions was from graph. The 2nd question was a string operation question, and the third question was a hard variant of the coin exchange problem.

Three rounds of interviews, one online assessment. The interview level was hard as expected. Questions included: * High-level design (HLD) * Low-level design (LLD) * DSA question: LeetCode Hard Dungeon Game * Computer core concepts * Projects