Grouped by pattern, in the order worth learning them. Each problem has hints, the approach, and a LeetCode submission link.
Solved
| Topic | Details | Category | Preview |
|---|---|---|---|
In-place index manipulation, single-pass scans and clever reuse of the input array. | 13 problems 0/13 | Foundations | |
Character-level parsing, palindromes, rotations and pattern matching on text. | 10 problems 0/10 | Foundations | |
Trading memory for speed with hash sets and maps for O(1) lookups and counting. | 8 problems 0/8 | Foundations | |
Moving two indices toward or alongside each other to prune a quadratic search. | 8 problems 0/8 | Core patterns | |
Growing and shrinking a contiguous window to answer subarray and substring questions in one pass. | 8 problems 0/8 | Core patterns | |
Precomputing running totals so any range sum is a subtraction, often paired with a hash map. | 6 problems 0/6 | Core patterns | |
Halve the search space every step: on sorted data, on rotated arrays, and on the answer itself. | 10 problems 0/10 | Core patterns | |
Implementing and adapting merge, quick, counting and bucket sort, and designing custom orderings. | 5 problems 0/5 | Core patterns | |
Build solutions one choice at a time, explore each branch, and undo the choice before trying the next. | 10 problems 0/10 | Core patterns | |
Rewire pointers safely: reversal, fast/slow runners, dummy heads, and list-backed data structures. | 10 problems 0/10 | Data structures & graphs |
Showing 1–10 of 23 topics