Shortest Distance After Road Addition Queries I (LeetCode 3243)
MediumLeetCode 3243 · BFS · Google, Amazon +1 · 25:20Shortest Distance After Road Addition Queries I · Easy Explanation · Leetcode 3243My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 3243 Shortest Distance After Road Addition Queries I by codestorywithMIK: Graphs, Medium. Topics: Array, Breadth-First Search, Graph Theory. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Breadth-First Search, Graph Theory
- Patterns
- BFS
- Chapter
- Graphs
- Duration
- 25:20
Related problems
- Number of Provinces - (Google, Microsoft,Amazon) (LeetCode 547)
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Is Graph Bipartite ? (LeetCode 785)
- Shortest Path in Weighted undirected graph
- Shortest Path in Binary Matrix (LeetCode 1091)
- Diameter Of Undirected Graph (LeetCode 1245)
- Find Minimum Diameter After Merging Two Trees (LeetCode 3203)