Flipkart

It was a role for freshers. The OA was an easy question. Whoever completed it within 30 minutes received an interview call. The interviewers were friendly. The interview process consisted of three rounds: * Two DSA rounds * One Hiring Manager round

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

Coding interviews were conducted in two rounds, lasting nearly one hour each. The first round was easy, while the second involved dynamic programming. This was part of their hackathon challenge.