Showing Posts From
Coding Interview
Jason Yang · 31 Mar, 2026
Longest Substring Without Repeating Characters (LeetCode 3): the sliding-window O(n) approach, and why the int[128] version can jump the left pointer instead of stepping — with interactive visuals.
Coding Interview
Jason Yang · 30 Mar, 2026
Longest Consecutive Sequence (LeetCode 128): the hash-set O(n) trick that only counts from sequence starts, with an interactive step-by-step visual.
Coding Interview
Jason Yang · 27 Mar, 2026
3Sum (LeetCode 15): sort then two-pointer for an O(n^2) solution, why sorting unlocks it, and the three places duplicate triplets sneak in — with an interactive visualization.
Coding Interview
Jason Yang · 03 Dec, 2025
Search in Rotated Sorted Array (LeetCode 33): a modified O(log n) binary search that finds which half is sorted, with an interactive step visual.
Coding Interview
Jason Yang · 02 Dec, 2025
Find Minimum in Rotated Sorted Array (LeetCode 153): the O(log n) binary search that locates the rotation pivot, explained step by step with examples.
Coding Interview
Jason Yang · 01 Dec, 2025
Maximum Product Subarray (LeetCode 152): why you track max and min together to handle negatives and zeros, and the O(n) dynamic-programming solution.
Coding Interview
Jason Yang · 29 Nov, 2025
Maximum Subarray (LeetCode 53): Kadane's algorithm explained as one decision — extend or restart — plus the O(n) to O(1) space drop and a full worked trace.
Coding Interview
Jason Yang · 28 Nov, 2025
Product of Array Except Self (LeetCode 238): the prefix and suffix product trick that avoids division for an O(n) solution, with an interactive visual.
