Google

Unfortunately, I didn't get past the first round. Despite multiple applications, I couldn't even secure the first interview, which was very disappointing to say the least. I will re-apply and update if there are any changes on that front.

I was asked a technical question on doubly linked lists. The task was to design and implement a restaurant queue system, ensuring all operations run in constant O(1) time complexity.

The first round was tough, and the rest were okay. It was all DSA questions with common patterns. Most of the questions are solvable within the given time frame. One of the questions seemed pretty hard.