• Home
  • Learn
  • Feed
  • Ladder
  • Saved
← Paths
🌳

Graphs & Trees

Traversals, shortest paths, union-find, and tree algorithms.

Curriculum · 91 lessons

01Naive String Matchingintro4m02Matrix Traversalintro4m03AVL Tree Rotationsintro4m04Max Flow and Min Cutintro4m05Graph Representation Tradeoffsintro4m06KMP Pattern Matching Deepintro5m07Dijkstra with Decrease Keyintro5m08Breadth First Search on Graphsintro4m09Breadth First Search Applicationsintro4m10The B Tree And B Plus Treeintro5m11Depth First Search Applicationsintro4m12Red Black Tree Rules Deepintro5m13Depth First Search on Graphscore4m14Checking if a Graph is Bipartitecore4m15Topological Sort DFScore5m16Tail Recursion and Stack Depthcore5m17SPFA Shortest Pathcore5m18The State Space Treecore4m19Cycle Detection In Undirected Graphscore4m20Bellman Ford Negative Cyclecore6m21Multi Source BFScore4m22Rolling Hash for Matchingcore6m23Bipartite Matchingcore5m24The Splay Treecore4m25Depth First Searchcore4m26Breadth First Searchcore5m27Detecting Cycles in Directed Graphscore5m28Cycle Detection In Directed Graphscore4m29The Segment Tree Buildcore5m30The Topological Sort Patterncore5m31The Recursion Tree Methodcore5m32Kruskal with Union Find Deepcore6m33The Two Heaps Pattern for Medianscore5m34The Segment Treecore6m35Topological Sort With Kahncore5m36The Segment Tree Introcore5m37The Fenwick Tree Deepcore5m38Heap Sort With A Heapcore5m39Prim with Heap Deepcore6m40The Euler Tour Techniquecore5m41The Binary Search Treecore5m42Minimum Spanning Tree With Primcore5m43The Fenwick Binary Indexed Treecore5m44Bellman Ford and Negative Edgescore5m45The Binary Heap Operationscore5m46Binary Indexed Tree Applicationscore5m47Dijkstra With A Heapcore5m48The Segment Tree Range Querycore5m49The Lowest Common Ancestor Binary Liftingcore5m50Lowest Common Ancestor with Binary Liftingcore5m51The Wildcard Matching DPcore6m52DP on Treescore5m53The Two Heaps Patterncore5m54The Binary Heapcore5m55Bellman Ford For Negative Edgescore5m56The Interval Treecore5m57The Segment Tree Lazy Deepcore6m58Topological Sortcore5m59Maximum Flow with Edmonds Karpcore5m60Minimum Spanning Tree with Kruskalcore5m61Bipartite Matching with Hopcroft Karpcore5m62KD Tree For Nearest Neighborcore6m63The Merge Sort Treecore5m64Tarjan Strongly Connected Componentscore5m65The Balanced AVL Treecore5m66The DFS Templateadvanced5m67The BFS Templateadvanced5m68Integer Overflow Handlingadvanced5m69The Min Cut Max Flow Theoremadvanced5m70Wildcard And Regex Matching DPadvanced6m71Minimum Spanning Treeadvanced6m72Zero One BFS with a Dequeadvanced5m73The Balanced Tree AVLadvanced5m74Union Findadvanced5m75Bipartite Check By Coloringadvanced4m76The Line Sweep with a Balanced Treeadvanced6m77The Red Black Tree Ideaadvanced6m78The Persistent Segment Treeadvanced6m79Union Find With Path Compressionadvanced5m80The Red Black Tree Intuitionadvanced5m81The Union Find Structureadvanced5m82KMP String Matchingadvanced6m83The Centroid Decompositionadvanced6m84Centroid Decompositionadvanced6m85Dijkstra Shortest Pathadvanced6m86Fenwick Tree Basicsadvanced5m87DSU on Tree Small to Largeadvanced5m88Articulation Points and Bridgesadvanced5m89Segment Tree Basicsadvanced6m90Strongly Connected Componentsadvanced6m91The Suffix Tree Ideaadvanced5m

Practice · 449 problems

⚔️Count Nodes1000⚔️Count Nodes in Binary Tree1000⚔️Maximum Depth of Binary Tree1050⚔️Sum of All Values1050⚔️Inorder Traversal1050⚔️Preorder Traversal1050⚔️Island Perimeter1050⚔️Kth Largest in a Stream1050⚔️Can Finish Courses1050⚔️Serialize Tree to Level Order1050⚔️Maximum Depth of a Binary Tree1050⚔️Inorder Traversal Array1050⚔️Sum of All Node Values1050⚔️Count Tree Nodes1050⚔️Increasing Order Traversal1080⚔️Preorder Traversal Array1080⚔️Find Maximum Value1100⚔️Find Center of Star Graph1100⚔️Find the Town Judge1100⚔️Postorder Traversal1100⚔️Max Area of Island1100⚔️Count Connected Components1100⚔️Sort Characters by Frequency1100⚔️Sum of Left Leaves1100

+ 425 more in the arena