Sliding window without the guessworkOct 18, 2026 · @Utkarsh Shrivastava Sliding window turns "check every subarray" (O(n²)) into one pass (O(n)). Grow the window on the right, shrink it on the left, and keep state you can update in O(1)Oct 18 · 3 min readbasecase-utkarsh.hashnode.dev
Binary search without the off-by-one guessworkBinary search is easy to explain and easy to get wrong. left <= right or left < right? mid or mid + 1? Return left or right? Here's my first attempt at LeetCode 981: Time Based Key-Value Store, which Oct 11 · 3 min readbasecase-utkarsh.hashnode.dev
