Google·Software Engineer·Onsite - Multi Round
- Given a matrix with multiple path queries and additional constraints, find valid paths using depth-first search with backtracking.
- Solve a heap-based problem involving prioritization with additional constraints beyond the standard formulation, then optimize your solution and handle a follow-up variant.
“I got the approach right, DFS with backtracking, and the interviewer was on board.”