From Zero to Hero: A Problem Solving & Competitive Programming Path
A structured journey through algorithmic thinking — from array tricks and prefix sums to data structures built from scratch, in TypeScript.
2 partsThis series covers standalone algorithm deep-dives and competitive programming problems outside the LeetCode DSA Quest — problems that introduce a single technique cleanly and are worth studying in isolation.
More posts added as I work through problems that merit a full writeup.
- 01 Grid Equalization: Median, Modular Arithmetic, and QuickselectBlog
A walkthrough of LeetCode 2033 — why modular arithmetic determines feasibility, why the median is the optimal target, and what a Quickselect-based solution would look like.
- 02 Understanding Heaps: Trees, Arrays, and Priority QueuesBlog
A ground-up tour of the heap data structure — from binary tree rules and array indexing to insertion, deletion, heapify, and heap sort — based on Abdul Bari's lectures.