Data Structures & Algorithms
From first principles to FAANG-ready: master every data structure, algorithm, and pattern interviewers test.
Curated from the best — MDN · Kubernetes · AWS · OWASP · Google SRE & more
Core for technical interviews and writing efficient code. Skills: complexity analysis, core data structures, recursion, DP, and greedy algorithms.
The complete path — 7 of 154 topics have lessons here; the other 147 are marked learn anywhere. We won't pretend we cover everything.
Foundations & Problem-Solving Mindset
The mental models and habits that underpin everything else: how to read a problem, reason about correctness, and pick a language.
Complexity Analysis
How to measure and communicate the cost of an algorithm in time and space — the language every interviewer speaks.
Arrays & Strings
The most-tested data structures. Master contiguous memory, indexing, and the manipulation idioms that appear in nearly every interview.
Hashing & Hash-Based Structures
Constant-time lookup is the single biggest optimization lever in interviews. Understand how hashing works and when it breaks.
Two Pointers & Sliding Window
Two of the highest-yield patterns for linear-time array and string solutions. Recognizing them instantly separates strong candidates.
Linked Lists
Pointer-based linear structures that teach reference manipulation — and host a family of classic interview tricks.
Stacks, Queues & Deques
Restricted-access linear structures that model order and recursion. The basis for monotonic-stack and BFS techniques.
Recursion & Backtracking
The thinking style behind trees, graphs, and combinatorics. Master the call stack, base cases, and systematic search.
Sorting Algorithms
Ordering data underpins binary search, greedy, and interval problems. Know the classics cold and when to apply each.
Searching & Binary Search
Binary search is the most under-recognized pattern in interviews. Learn the template and the art of searching on the answer.
Trees & Binary Search Trees
Hierarchical structures that dominate the mid-to-hard interview range. Traversals and BST invariants are non-negotiable knowledge.
Heaps & Priority Queues
The go-to structure for top-k, scheduling, and streaming problems. Know heap mechanics and the patterns they unlock.
Graphs
The richest topic in senior interviews. Master representations, traversals, and the algorithm zoo built on top of them.
Advanced Trees & Disjoint Sets
Specialized structures that show up in hard problems and system-flavored questions. Strong differentiators at senior levels.
Greedy Algorithms
Locally optimal choices that sometimes yield global optimums. Learn to spot when greedy works — and prove it.
Dynamic Programming
The make-or-break topic for hard interviews. Build intuition for states, transitions, and the canonical DP families.
Bit Manipulation & Math
Low-level tricks and number theory that produce elegant O(1) solutions and occasionally make-or-break a problem.
Intervals & Object-Oriented Design
Frequently tested standalone topics: interval reasoning and translating requirements into clean data-structure-backed designs.
Advanced String Algorithms
Pattern matching and string-specific algorithms that surface in harder rounds and at companies with heavy text workloads.
Interview Patterns & Meta-Skills
The synthesis layer: recognizing which pattern a problem hides, and the communication and testing habits that win offers.
You're job-ready.
Clear every stage, earn the certificate, and walk into interviews prepared. The complete path — nothing hidden, no gaps.