DevPath
Tracks

Data Structures & Algorithms

The core toolkit every interview and every large codebase relies on.

0 of 18 complete

  1. 01Arrays and Dynamic ArraysHow arrays sit in memory, why indexing is instant, and how a growable array amortizes its cost.beginner · 35 min
  2. 02Linked ListsNodes joined by pointers: how singly and doubly linked lists work, plus the reverse, dummy-node and fast/slow pointer patterns.beginner · 40 min
  3. 03Stacks and QueuesLIFO and FIFO containers, the call stack, monotonic stacks, deques and circular buffers, with implementations and their costs.beginner · 40 min
  4. 04Hash TablesHow a hash function turns keys into array slots, what collisions and load factor mean, and how to build a table with chaining.beginner · 45 min
  5. 05Binary SearchHalve a search space every step: the lower-bound template, boundary pitfalls, and searching on the answer instead of an array.beginner · 40 min
  6. 06RecursionSolve a problem by solving smaller copies of it: base cases, the call stack, divide and conquer, and memoization as a first step to dynamic programming.beginner · 40 min
  7. 07SortingInsertion, merge and quick sort compared, plus stability, why comparison sorts need n log n, and when counting sort beats them.intermediate · 50 min
  8. 08Trees and Binary Search TreesHierarchical data, the four classic traversals, and how a binary search tree gives ordered search, insert and delete in O(h) time.intermediate · 50 min
  9. 09Heaps and Priority QueuesThe binary heap: how an array stores a tree, why push and pop cost O(log n), why heapify is O(n), and the top-k pattern.intermediate · 45 min
  10. 10Tries (Prefix Trees)A tree keyed by characters that makes prefix search, autocomplete and word lookup cost O(length of the word), independent of dictionary size.intermediate · 40 min
  11. 11Graphs: Representations, BFS and DFSModel networks as vertices and edges, choose between adjacency lists and matrices, and explore with breadth-first and depth-first search.intermediate · 50 min
  12. 12Graph Algorithms: Dijkstra, Topological Sort, Cycles, ComponentsWeighted shortest paths with Dijkstra, ordering tasks with topological sort, detecting cycles, and counting connected components.advanced · 60 min
  13. 13Two Pointers and Sliding WindowTurn nested loops into a single pass by moving two indexes cleverly: opposite-end pointers, fast and slow pointers, and windows that grow and shrink.intermediate · 40 min
  14. 14BacktrackingExplore choices one at a time, undo them when they fail, and prune whole branches early. Subsets, permutations, and N-Queens.intermediate · 45 min
  15. 15Dynamic ProgrammingSolve a problem by breaking it into overlapping sub-problems and remembering each answer. Top-down vs bottom-up, coin change, LCS, and knapsack.advanced · 55 min
  16. 16Greedy AlgorithmsMake the best local choice at every step and never look back. Interval scheduling, the exchange argument, and how to spot when greedy fails.intermediate · 40 min
  17. 17Union-Find (Disjoint Sets)Track which items belong to the same group with near-constant-time merge and lookup, using path compression and union by size.intermediate · 35 min
  18. 18String AlgorithmsAnagram checks with counts, linear-time pattern matching with KMP and rolling hashes, and palindromes by expanding around centers.intermediate · 45 min