Two back to back interviews - both technical. In the first interview, a brief resume walkthrough and then a few questions about multithreading, trees etc. Then he asked me how to implement a queue using 2 stacks, how to do an in-order traversal of bst without recursion, compare time complexities of different operations in linked list and hash table. In the 2nd, he asked to implement algorithm to solve the word ladder problem given a dictionary. And how to implement a stack that supports minimum operation in O(1).

Surprisingly easy — I expected tougher questions, but the coding round felt more like a warm-up. The main challenge was a DSA problem about counting islands in a 2D grid, which led to a discussion on DFS versus BFS and handling large grids. Funny enough, I had revisited that exact type of question while prepping on PracHub, which made me feel more confident. The interview wrapped up with a behavioral round, and I accepted an offer, but ultimately decided to decline it for another opportunity. Overall, it was a smooth experience.