LeetCode Quest: Data Structures & Algorithms
A level-by-level walkthrough of LeetCode's DSA Quest — problems, insights, and solution comparisons for every completed unit of the Linear Shoal and beyond.
4 partsLeetCode’s Quest feature turns DSA practice into a structured progression — units unlock in sequence, each building on the last. This series follows the journey level by level, from the Linear Shoal all the way through to the Strategy Summit.
- 01 LeetCode Quest: DSA — Array I (Linear Shoal)Blog
Working through the Array I unit of LeetCode's Data Structures & Algorithms Quest — concatenation, interleaving, and streak-counting, with a look at when a two-pointer is cleaner than a for-loop.
- 02 LeetCode Quest: DSA — Array II (Linear Shoal)Blog
The Array II unit of LeetCode's DSA Quest — finding duplicates and missing numbers, counting smaller elements with prefix sums, and the in-place negation trick for O(1) space disappearance detection.
- 03 LeetCode Quest: DSA — Stack (Linear Shoal)Blog
The Stack unit of LeetCode's DSA Quest — simulating stack operations on a stream, evaluating Reverse Polish Notation three ways, and tracking exclusive CPU time with an interval-accounting stack.
- 04 LeetCode Quest: DSA — Heap (Sequence Valley)Blog
Last Stone Weight: from a sort-each-iteration brute force to building a max-heap from scratch in TypeScript, with every bug and lesson along the way.