Google

The interview had two stages. First, a telephonic interview, and then a Hangouts call. In the telephonic interview, I was asked about normal problems and some puzzles, like: If an egg is dropped from above that floor, it will break. If it is dropp

Phone Round: Basic questions on stacks and queues. Asked DFS, BFS. First Round: Asked one question on shortest path. Gave a brute force solution but could not provide an optimal solution. The interviewer was unsatisfied with the answer. Rejected.

Dedicatedly immersed in an intensive review of Data Structures and Algorithms (DSA), recognizing their pivotal role. Committed to thorough revision, aiming for a profound grasp. Striving for excellence through unwavering focus and diligent preparat