Subjects
Algorithms Subjects
Sorting
Comparison sorts, their trade-offs, and when each one shines.
Last updated: 15/03/2026Binary Search
The divide-and-conquer search technique that powers everything from databases to Git.
Last updated: 15/03/2026Two Pointers
A technique for solving array and string problems in O(n) time with two scanning indices.
Last updated: 15/03/2026Sliding Window
Efficiently processing contiguous subarrays and substrings.
Last updated: 15/03/2026Recursion
Breaking problems into smaller subproblems — the foundation of divide-and-conquer and dynamic programming.
Last updated: 15/03/2026