Round 1
Questions: Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Graph Problems
DFS:
- 2685. Count the Number of Complete Components
- 323. Number of Connected Components in an Undirected Graph
- 797. All Paths From Source to Target
- 802. Find Eventual Safe States
BFS:
Multi-Source BFS:
- 994. Rotting Oranges
- 542. 01 Matrix
- 1765. Map of Highest Peak
- 1970. Last Day Where You Can Still Cross [Binary-search + BFS]
- 2258. Escape the Spreading Fire [Binary-search + BFS]
Dijkstra Algorithm:
- 1976. Number of Ways to Arrive at Destination
- 1514. Path with Maximum Probability
- 3341. Find Minimum Time to Reach Last Room I [Grid]
- 3341. Find Minimum Time to Reach Last Room II [Grid]
- 2577. Minimum Time to Visit a Cell In a Grid [Grid]
Topological Sort:
Reverse the edges:
- 3419. Minimize the Maximum Edge Weight of Graph [Binary-search + DFS]
Tarjan's Algorithm/Bridges in Graph: