Google L3 | Onsite Interview | Bangalore
Anonymous User
907
Jun 23, 2025
Interview 1 (DSA - 45 mins)
- Topo Sort - Asked to code optimally with clear TC/SC analysis
Difficulty - Hard
Similar: https://leetcode.com/problems/alien-dictionary/description/
Interview 2 (DSA - 45 mins)
- Disjoint Set based graph - Asked to code optimally with TC/SC analysis
Difficuly - Hard
Similar - https://leetcode.com/problems/making-a-large-island/description/
Interview 3 (DSA - 45 mins)
- Graph based Tree - started with medium level question and then asked 2 follow ups and asked to code all variations along with TC/SC
Difficult - Medium-Hard
Similar - https://leetcode.com/problems/graph-valid-tree/description/
Followup:- return the root of the final tree
- color the tree (with 2 colors) such that a color doesn't occur consecutively (parent-child color is not same - BFS traversal)
Interview 4 (Googlyness - 45 mins)
- Discussed my past projects and responsibilities in detail.
- Presented with hypothetical workplace scenarios and asked how I would respond in those situations.
Comments (3)


