Coding Interview
Jason Yang · 03 Aug, 2026
Greedy algorithms are quick to write and often wrong. How to tell when the greedy choice is provably optimal, the exchange argument, and the NeetCode problems.
Coding Interview
Jason Yang · 03 Aug, 2026
Dynamic programming in Java without the fear: how to name the state and find the recurrence, the 1D DP problem families, and when to memoize vs tabulate.
Coding Interview
Jason Yang · 03 Aug, 2026
Binary search in Java, beyond the sorted-array lookup: the boundary template that kills off-by-one bugs, searching on the answer, and rotated-array problems.
Coding Interview
Jason Yang · 03 Aug, 2026
The sliding-window pattern in Java: fixed vs variable windows, what to track inside, and how it solves Longest Substring and Minimum Window in one O(n) pass.
AI & LLM
Jason Yang · 22 Jul, 2026
The hard part of a Claude Code agent loop isn't repeating work. It's a stop condition you can trust: convergent vs exploratory, and who enforces the verdict.
