Longest Path With Different Adjacent Characters (LeetCode 2246)
HardLeetCode 2246 · DFS · Amazon, Microsoft +3 · 23:44Longest Path With Different Adjacent Characters : (Microsoft) · Explanation ➕ Live CodingMy 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 2246 Longest Path With Different Adjacent Characters by codestorywithMIK: Graphs, Hard. Topics: Array, String, Tree, Depth-First Search. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- hard
- Topics
- Array, String, Tree, Depth-First Search, Graph Theory, Topological Sort
- Patterns
- DFS, Topological Sort
- Chapter
- Graphs
- Duration
- 23:44
Related problems
- Graph Concepts & Qns - 4 (Microsoft, Amazon, Flipkart) : Detect Cycle in Undirected Graph using DFS
- Number of Provinces - (Google, Microsoft ) (LeetCode 547)
- Course Schedule (LeetCode 207)
- Course Schedule-II (LeetCode 210)
- Is Graph Bipartite ? (LeetCode 785)
- Strongly Connected Components
- Hierholzer's Algorithm (LeetCode 2097)
- Diameter Of Undirected Graph (LeetCode 1245)