Google

There were a total of four rounds. Three of them were on-campus, face-to-face interviews in Bangalore. The first round was a telephonic round based on simple data structure and algorithm questions. The focus was on the approach, not the final solutio

During on-campus recruitment, questions covered various graph and bit-masking problems found in standard lists. These were crackable through basic practice. The second and third questions involved trees and dynamic programming.

The interviewer was very friendly. He asked me just one DSA question from DP, which was easy after the interview was over, to be frank. However, I was unable to crack it during the interview. He kept giving me hints, but I was confused on how to tack