🧮

DSA Foundations

Core data structures and algorithms — from Big-O to hashing, two-pointers, and sorting.

Curriculum · 371 lessons

01The Stack Abstract Data Typeintro4m 02Linear Search Basicsintro3m 03The Sliding Window Patternintro4m 04The Singly Linked Listintro4m 05The Brute Force Baselineintro4m 06Naive String Matchingintro4m 07Representing Intervalsintro4m 08One Dimensional Linear DPintro4m 09Big-O, intuitivelyintro5m 10Binary Searchintro4m 11Matrix Traversalintro4m 12Adjacency List versus Matrixintro4m 13Difference Arraysintro4m 14The Cross Product and Orientation Testintro4m 15Space Complexity Analysisintro4m 16The Sieve of Eratosthenesintro4m 17The Backtracking Templateintro4m 18The Two Pointer Techniqueintro4m 19The Dynamic Array Growthintro4m 20Points and Vectors Basicsintro4m 21Fisher Yates Shuffleintro4m 22AVL Tree Rotationsintro4m 23Bubble And Insertion Sort Intuitionintro4m 24Max Flow and Min Cutintro4m 25Best, Average, and Worst Caseintro4m 26Two Pointersintro4m 27Flood Fillintro3m 28Modular Exponentiationintro4m 29String Hashing for Substring Comparisonintro4m 30The Two Pointers Patternintro4m 31The Dynamic Array and Amortized Resizingintro5m 32Prime Factorizationintro4m 33Graph Representation Tradeoffsintro4m 34KMP Pattern Matching Deepintro5m 35Dijkstra with Decrease Keyintro5m 36Polygon Area with the Shoelace Formulaintro4m 37The Prefix Function Intuitionintro5m 38Generating Subsetsintro3m 39Merging Overlapping Intervalsintro4m 40Hash maps: the O(1) superpowerintro4m 41Recursion and the Call Stackintro4m 42Fast and Slow Pointersintro4m 43Breadth First Search on Graphsintro4m 44Boyer Moore Majority Voteintro4m 45Iterative versus Recursive Tradeoffsintro4m 46The Greatest Common Divisor by Euclidintro4m 47Breadth First Search Applicationsintro4m 48Opposite Ends Pointersintro4m 49Heuristics and Local Searchintro4m 50The Z Algorithmintro4m 51Cross Product Orientationintro4m 52Two Dimensional Grid DPintro4m 53The B Tree And B Plus Treeintro5m 54Prefix Sumsintro3m 55The Doubly Linked Listintro4m 56Binary Search On A Sorted Arrayintro4m 57The Interval Scheduling Greedyintro4m 58The Modular Inverseintro4m 59A Star Search Heuristicintro5m 60Ternary Search for Unimodal Functionsintro4m 61Ternary Search on Real Functionsintro4m 62The Greedy Choice Propertyintro5m 63Depth First Search Applicationsintro4m 64Generating Permutationsintro4m 65The Fast and Slow Pointersintro4m 66NP Completeness Introintro5m 67Boyer Moore Heuristicsintro5m 68Polygon Area Shoelaceintro4m 69Las Vegas Versus Monte Carlointro4m 70DP Space Optimization with Rolling Arraysintro4m 71Red Black Tree Rules Deepintro5m 72The Failure Links Ideaintro5m 73Fermat's Little Theoremintro4m 74Bidirectional Searchintro4m 75Depth First Search on Graphscore4m 76Interval Scheduling Maximizationcore4m 77Kadane Maximum Subarraycore4m 78Finding Connected Componentscore4m 79Checking if a Graph is Bipartitecore4m 80The Merge Intervals Patterncore5m 81Stable versus Unstable Sortingcore4m 82Modular Arithmetic Basicscore4m 83Generating Combinationscore4m 84The Merge Two Sorted With Pointerscore4m 85The Subset Sum Patterncore4m 86Topological Sort DFScore5m 87The Monotonic Dequecore5m 88Point in Polygon Testcore5m 89In Place Reversal of a Linked Listcore5m 90Tail Recursion and Stack Depthcore5m 91The Queue Abstract Data Typecore4m 92The Trie for Prefix Searchcore5m 93Counting Sort For Small Rangescore4m 94The Rat In A Mazecore4m 95The Sliding Window Fixed Sizecore4m 96The Difference Array for Rangescore4m 97SPFA Shortest Pathcore5m 98Coin Changecore4m 99The State Space Treecore4m 100The Stack With Arraycore4m 101The Deque Operationscore4m 102Kahn Algorithm Deepcore5m 103The Treapcore4m 104Interval Schedulingcore4m 105Square Root Decompositioncore5m 106Line Segment Intersectioncore5m 107The Cyclic Sort Patterncore5m 108The Divide and Conquer Paradigmcore5m 109The Optimal Substructure Propertycore5m 110Palindrome Detection with Expansioncore5m 111Cycle Detection In Undirected Graphscore4m 112Exponential Searchcore4m 113The Combination Sumcore4m 114The Prefix Sum Techniquecore4m 115The Eulerian Pathcore4m 116The Trie Compression Radixcore5m 117The Unbounded Knapsackcore4m 118Bellman Ford Negative Cyclecore6m 119Sliding Windowcore5m 120Longest Common Subsequencecore5m 121Multi Source BFScore4m 122The Sliding Window Techniquecore5m 123The Sparse Table for Range Queriescore5m 124The Convex Hull with Graham Scancore5m 125The Subsets Patterncore5m 126Amortized Analysis Basicscore5m 127The Dequecore4m 128Overlapping Subproblemscore5m 129Rolling Hash for Matchingcore6m 130The Extended Euclidean Algorithmcore5m 131The Lower And Upper Boundcore4m 132The Word Search Gridcore4m 133The Sliding Window Variable Sizecore5m 134The Sweep Line Techniquecore5m 135Bipartite Matchingcore5m 136Streaming Mediancore5m 137The Zero One Knapsackcore5m 138The Splay Treecore4m 139Depth First Searchcore4m 140The Rolling Hashcore5m 141Comparison versus Non Comparison Sortscore5m 142Fast Exponentiationcore4m 143Floyd Warshall Deepcore6m 144Breadth First Searchcore5m 145The Knapsack Problemcore5m 146Detecting Cycles in Directed Graphscore5m 147Randomized Quickselectcore5m 148The Z Functioncore5m 149The Top K Elements Patterncore5m 150Greedy versus Dynamic Programmingcore5m 151Memoization versus Tabulationcore5m 152Cycle Detection In Directed Graphscore4m 153Palindrome Partitioningcore4m 154The Partition By Pivotcore5m 155The Queue With Circular Buffercore5m 156The Hash Table Chainingcore5m 157The Trie Structurecore4m 158The Meeting Rooms Problemcore5m 159Convex Hull Andrew Monotonecore5m 160Skip List Randomizationcore5m 161Modular Combinatoricscore5m 162The Segment Tree Buildcore5m 163Exchange Argument Proofscore5m 164The Topological Sort Patterncore5m 165The Recursion Tree Methodcore5m 166The Longest Common Subsequence Recurrencecore6m 167Binomial Coefficient Computationcore5m 168Merge Sort And Its Recurrencecore5m 169The Kadane Running Sumcore5m 170Range Sum With a BITcore4m 171The Euler Totient Functioncore5m 172Kruskal with Union Find Deepcore6m 173Monotonic Stackcore5m 174Word Ladder Shortest Transformationcore5m 175The Two Heaps Pattern for Medianscore5m 176The Segment Treecore6m 177The KMP Failure Functioncore5m 178The Master Theoremcore6m 179The Hash Table with Chainingcore5m 180The Decrease and Conquer Ideacore5m 181Double Hashing to Avoid Collisionscore5m 182Combinatorics Counting Principlescore5m 183Topological Sort With Kahncore5m 184The N Queens Problemcore5m 185The Shrinking Window Conditioncore5m 186The Segment Tree Introcore5m 187The Ford Fulkerson Methodcore5m 188Suffix Array Constructioncore6m 189Convex Hull Graham Scancore6m 190Misra Gries Heavy Hitterscore5m 191DP with a State Machinecore5m 192Johnson All Pairscore6m 193The Fenwick Tree Deepcore5m 194Merge Sortcore4m 195The K Way Merge Patterncore5m 196Bit Counting Trickscore4m 197Heap Sort With A Heapcore5m 198Edit Distance Variantscore6m 199Gaussian Eliminationcore5m 200Prim with Heap Deepcore6m 201The Line Sweep Techniquecore5m 202The Euler Tour Techniquecore5m 203The Activity Selection Greedy Proofcore5m 204The Binary Search Treecore5m 205The Divide and Conquer Recurrencecore6m 206The Edit Distance Recurrencecore6m 207Minimum Spanning Tree With Primcore5m 208The Difference Arraycore5m 209The Fenwick Binary Indexed Treecore5m 210Approximation Algorithmscore5m 211Bloom Filter Deep Divecore6m 212Dynamic Programming Introcore5m 213Edit Distancecore5m 214Bellman Ford and Negative Edgescore5m 215Bitmask Dynamic Programmingcore5m 216The Inclusion Exclusion Principlecore5m 217Ternary Search On A Unimodal Functioncore4m 218The Sudoku Solvercore5m 219The Hash Table Open Addressingcore5m 220The Binary Heap Operationscore5m 221The Suffix Automaton Introcore6m 222Voronoi Diagram Introcore5m 223Longest Increasing Subsequencecore5m 224Binary Indexed Tree Applicationscore5m 225Lazy Propagationcore6m 226Modified Binary Search Patterncore6m 227The Hash Table with Open Addressingcore5m 228Transform and Conquercore5m 229Dijkstra With A Heapcore5m 230The Segment Tree Range Querycore5m 231The Hungarian Algorithm Ideacore5m 232MinHash Similaritycore5m 233Matrix Exponentiationcore5m 234The Lowest Common Ancestor Binary Liftingcore5m 235Quicksortcore5m 236Lowest Common Ancestor with Binary Liftingcore5m 237Amortized Analysis with the Accounting Methodcore5m 238The Wildcard Matching DPcore6m 239The Catalan Numberscore5m 240Interpolation Searchcore4m 241DP on Treescore5m 242Quickselectcore5m 243Interval Dynamic Programmingcore5m 244Two Satisfiabilitycore5m 245The Two Heaps Patterncore5m 246The Binary Heapcore5m 247Randomization in Algorithmscore5m 248Bellman Ford For Negative Edgescore5m 249The Interval Treecore5m 250Traveling Salesman Approachescore6m 251Longest Common Substring With Suffixcore5m 252Delaunay Triangulation Introcore5m 253Count Min Sketch Deep Divecore6m 254The Segment Tree Lazy Deepcore6m 255Topological Sortcore5m 256Maximum Flow with Edmonds Karpcore5m 257Suffix Structures Overviewcore6m 258Solving Linear Recurrencescore5m 259Minimum Spanning Tree with Kruskalcore5m 260Bipartite Matching with Hopcroft Karpcore5m 261Closest Pair of Points Divide and Conquercore6m 262The LRU Cache Structurecore5m 263The Probabilistic Analysis Ideacore5m 264Floyd Warshall All Pairscore5m 265Manacher Palindromes Deepcore6m 266KD Tree For Nearest Neighborcore6m 267Interval DPcore5m 268The Merge Sort Treecore5m 269Tarjan Strongly Connected Componentscore5m 270Digit Dynamic Programmingcore6m 271The Balanced AVL Treecore5m 272Locality Sensitive Hashingcore6m 273The Miller Rabin Primality Testcore5m 274Bounding Volume Hierarchycore6m 275The Number Theoretic Transformcore6m 276The DFS Templateadvanced5m 277The BFS Templateadvanced5m 278Floyd Cycle Detectionadvanced5m 279Reservoir Samplingadvanced5m 280The Bitset Optimizationadvanced5m 281Quickselect For The Kth Elementadvanced5m 282Integer Overflow Handlingadvanced5m 283The Min Cut Max Flow Theoremadvanced5m 284The Voronoi Diagram Ideaadvanced5m 285Backtracking Templateadvanced6m 286The Pigeonhole Principle in Algorithmsadvanced5m 287The Longest Common Prefix Arrayadvanced6m 288The Gray Code Constructionadvanced5m 289Wildcard And Regex Matching DPadvanced6m 290Minimum Spanning Treeadvanced6m 291Zero One BFS with a Dequeadvanced5m 292The Balanced Tree AVLadvanced5m 293Union Findadvanced5m 294Modular Inverseadvanced5m 295Persistent Data Structuresadvanced6m 296The Rotating Calipers Techniqueadvanced6m 297The Loop Invariant Proofadvanced6m 298The Fibonacci Matrix Formadvanced5m 299Bipartite Check By Coloringadvanced4m 300Quicksort Partition Schemesadvanced5m 301The Cycle Detection Floydadvanced6m 302The Longest Repeated Substringadvanced5m 303Rabin Karp Rolling Hashadvanced5m 304The Meet in the Middle Techniqueadvanced5m 305The Line Sweep with a Balanced Treeadvanced6m 306The Hungarian Algorithm for Assignmentadvanced5m 307The Delaunay Triangulation Ideaadvanced5m 308The Difference Between P and NPadvanced6m 309The Red Black Tree Ideaadvanced6m 310Sequence Alignmentadvanced7m 311The Knight Touradvanced5m 312The Dutch National Flagadvanced6m 313The String Hashing Collisionsadvanced5m 314Rotating Calipersadvanced6m 315HyperLogLog Deep Diveadvanced7m 316Kosaraju SCCadvanced6m 317The Persistent Segment Treeadvanced6m 318Backtrackingadvanced5m 319A Star Searchadvanced6m 320The Convex Hull Ideaadvanced5m 321Mo's Algorithm for Offline Queriesadvanced6m 322The Exchange Argumentadvanced6m 323Union Find With Path Compressionadvanced5m 324The Red Black Tree Intuitionadvanced5m 325The Union Find Structureadvanced5m 326Lucas' Theoremadvanced5m 327Johnson Algorithm for All Pairsadvanced6m 328Binary Search on the Answeradvanced6m 329KMP String Matchingadvanced6m 330The Chinese Remainder Theoremadvanced6m 331The Suffix Arrayadvanced6m 332Sweep Line for Segment Intersectionadvanced6m 333Dynamic Programming State Designadvanced6m 334Reductions Between Problemsadvanced6m 335The Disjoint Set Forestadvanced6m 336The Adversary Argument for Lower Boundsadvanced6m 337The Manacher Algorithm Ideaadvanced7m 338Radix Sort Digit By Digitadvanced5m 339Pruning The Search Spaceadvanced5m 340The Monotonic Deque Windowadvanced6m 341The Sparse Table for RMQadvanced6m 342The Tarjan Algorithmadvanced6m 343Closest Pair Of Pointsadvanced7m 344Online Competitive Ratioadvanced6m 345Bitmask DPadvanced6m 346Tarjan SCC Deepadvanced7m 347The Centroid Decompositionadvanced6m 348Centroid Decompositionadvanced6m 349Pollard Rho Factorizationadvanced6m 350Dijkstra Shortest Pathadvanced6m 351Fenwick Tree Basicsadvanced5m 352The Aho Corasick Automatonadvanced6m 353DSU on Tree Small to Largeadvanced5m 354The Potential Method for Amortized Analysisadvanced6m 355NP Completeness Intuitionadvanced6m 356Line Sweep For Intersectionsadvanced7m 357Randomized Roundingadvanced6m 358Digit DPadvanced6m 359The Heavy Light Decompositionadvanced6m 360Matrix Exponentiation for Recurrencesadvanced6m 361Articulation Points and Bridgesadvanced5m 362Memoized Backtrackingadvanced5m 363Line Sweep for Rectanglesadvanced6m 364The Fast Fourier Transform Ideaadvanced6m 365Segment Tree Basicsadvanced6m 366Strongly Connected Componentsadvanced6m 367The Heavy Light Decomposition Ideaadvanced6m 368The Suffix Tree Ideaadvanced5m 369Hamiltonian Path Hardnessadvanced5m 3702 SAT with SCCadvanced7m 371DP Optimization with the Convex Hull Trickadvanced6m