Google

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.

I applied for a summer internship, and the interview was easy. Two rounds were conducted. The first round included two DSA questions that could be easily solved. The second round was a behavioral round, which was also easy.

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