6 interviews. 5 algorithms + 1 behavioural. Topics were advanced and needed more than just the basic knowledge in algorithms but the questions themselves werent that hard. If you had a really good understanding of the topics the interviews would be easy. Got dynamic programming, trees, binary search, geometry, strings and graph theory questions
1. The longest sequence in a matrix 2. The number appear more than k times in an array of length n. (k>1/4 of n) 3. Encoder for a string. 4. Search Circle in a Directed Graph.
Can't say, study your data structures and algorithms.
one of the questions in the coding challenge was about file paths, and the big one during the phone interview was about hash tables. fair questions, not too difficult but challenging enough that you don't just breeze through them.
One was something about permutations
Strengths/Weaknesses
In a crowded room do I gravitate toward the corner or center? (measuring introversion/extroversion)
Several problems involved knowing how to search a graph.
Code something related to DFS in language of your choice. Write out recurrence relation and runtime
Why do you want to work for Google?
Viewing 9691 - 9700 interview questions