Google interview question
- one dynamic programming question - one DFS/BFS question - one graph question that required Union-find - one that used a 2d matrix and a priority queue. - a behavioural interview
- one dynamic programming question - one DFS/BFS question - one graph question that required Union-find - one that used a 2d matrix and a priority queue. - a behavioural interview
Check out your Company Bowl for anonymous work chats.