Skip to content
Journal

Algorithms

5 posts
  1. The Frontend Engineer's LeetCode Blueprint, Part 5: The Grandmaster's ToolkitSmall constraints like N ≤ 16 are a signal, not a gift. The finale covers bitmask backtracking with N-Queens, bitmask DP for shortest-path-visiting-all-nodes, and the 60-minute Toptal/Codility survival protocol.JavaScriptFrontend11 min
  2. The Frontend Engineer's LeetCode Blueprint, Part 4: The Dynamic Programming Vault & String AutomatauseMemo and Reselect are dynamic programming with different names. Part 4 covers top-down versus bottom-up DP, the 0/1 knapsack pattern, Edit Distance, and a Trie-backed Word Search II solver.JavaScriptFrontend12 min
  3. The Frontend Engineer's LeetCode Blueprint, Part 3: Trees, Graphs and Solution SpacesThe virtual DOM, AST transpilation and bundler dependency resolution are all tree and graph traversal in production. Part 3 covers post-order tree recursion, topological sort and binary search on the answer space.JavaScriptFrontend12 min
  4. The Frontend Engineer's LeetCode Blueprint, Part 2: The Pointer & Memory PlaygroundReact Fiber and the DOM tree are linked lists in disguise. Part 2 covers fast-and-slow pointers, in-place reversal, the monotonic stack and a from-scratch LRU cache built on a doubly linked list plus hash map.JavaScriptFrontend11 min
  5. The Frontend Engineer's LeetCode Blueprint, Part 1: The Linear GauntletFrontend habits like map/filter/reduce chains fail LeetCode's hidden test suites. Part 1 covers V8 array internals, two pointers and sliding windows, with worked solutions for 3Sum, Minimum Window Substring and Trapping Rain Water.JavaScriptFrontend12 min