Coding Interview
Understanding the Two Pointers Technique
Jason Yang · 27 Mar, 2026
The Two Pointers technique explained with clear examples: sorted arrays, sliding windows, and linked lists — a practical guide for coding interviews.
Showing Posts From
Algorithm
Coding Interview
Divide and Conquer (D&C): Beyond Merge Sort
Jason Yang · 03 Dec, 2025
Divide and Conquer is more than Merge Sort: the 3-step design paradigm, how it differs from plain recursion, and the interview patterns that use it.
Coding Interview
Why is Binary Search O(log n)?
Jason Yang · 02 Dec, 2025
Binary Search runs in O(log n) because it halves the search space every step. Here's the intuition, the math proof, and how it compares to linear search.
Coding Interview
Dynamic Programming Explained: The Missing Link with Divide & Conquer
Jason Yang · 01 Dec, 2025
Dynamic Programming demystified: at its core, DP is just Divide and Conquer plus memory. See the connection and it gets far easier to explain in interviews.
Coding Interview
Understanding Prefix and Suffix Patterns
Jason Yang · 28 Nov, 2025
Prefix Sum and Suffix Product explained: what these algorithm terms really mean, why they beat naive recomputation, and where they show up in problems.
Coding Interview
Understanding One-Pass Algorithms and Greedy Strategies
Jason Yang · 27 Nov, 2025
One-pass and greedy algorithms: how a single scan and greedy choices process large data with minimal memory — the core ideas and when they're optimal.