Section 01
Foundations
Big-O, complexity classes, V8 internals, and how to measure.
ES2024 · intermediate
The complete DSA track for JS engineers. Big-O, every core data structure (arrays, hash maps, linked lists, stacks, queues, trees, heaps, graphs, tries), every classic algorithm (sorting, searching, recursion, DP, greedy, graph algos, string algos), plus the V8 and Node.js performance reality every JS algorithm runs on top of.
Section 01
Big-O, complexity classes, V8 internals, and how to measure.
Section 02
Two-pointers, sliding window, prefix sums, Kadane, string algorithms.
Section 03
Map, Object, Set, WeakMap/WeakSet, frequency counting, LRU.
Section 04
Singly, doubly, circular — reversal, cycles, merging.
Section 05
Stacks, queues, deques, monotonic stacks, circular buffers.
Section 06
Recursion mechanics, divide-and-conquer, permutations, N-Queens.
Section 07
Every classic sort + V8's TimSort.
Section 08
Linear, binary, binary-on-answer, exponential, ternary, rotated.
Section 09
Binary trees, BST, traversals, LCA, balanced trees.
Section 10
Binary heaps, heapify, PQ in JS, top-K, running median.
Section 11
BFS, DFS, topo sort, Dijkstra, Bellman-Ford, MST, Union-Find.
Section 12
Prefix trees, autocomplete, word search, suffix tries.
Section 13
Memoization, tabulation, knapsack, LCS, LIS, edit distance.
Section 14
Greedy strategies, interval scheduling, Huffman, JS bit ops.
Section 15
Event loop, worker_threads, streams, profiling, interview patterns.