dsa1 min read
Get Equal Substrings Within Budget [Medium] — Variable Window Cost
Find the maximum length substring you can transform from s to t within a given cost budget using a sliding window on character change costs.
Read →
All Posts
1276 articles
dsa1 min read
Number of Substrings Containing All Three Characters [Medium]
Count substrings containing at least one a, b, and c using the last-seen indices shortcut for O(n) time.
Read →
dsa1 min read
Subarray Sum Divisible by K [Medium] — Prefix Sum Modulo
Count subarrays with sum divisible by k using prefix sum modulo k and a frequency map of remainders.
Read →
dsa1 min read
Find K Closest Elements [Medium] — Binary Search + Two Ptr
Find k closest integers to x in a sorted array using binary search to locate the optimal left boundary of the window.
Read →
dsa1 min read
Count Subarrays With Fixed Bounds [Hard] — One-Pass Window
Count subarrays where min=minK and max=maxK using a single pass tracking the last invalid position and last positions of minK and maxK.
Read →
Page 124 of 256