Google

The entire interview was quite chill. I had 5 rounds: 1 LP and 4 coding. The interviewer was super nice and would help you if you got stuck. Really good experience.

It was really tough. I was asked to solve a graph problem that involved Dijkstra's algorithm. Honestly, it was kind of ridiculous since I've never used this on my job before. I was asked to solve a graph problem that involved...

1. Ask the problem and solution of my previous project. 2. Introduce one of my favorite course projects. 3. Explain Binary Search Tree. 4. Find the next larger node and write down code in BST. 5. Check whether a string is symmetric and how to tes