dsa1 min read
Maximum Points You Can Obtain from Cards [Medium] — Complement Window
Maximize card points taken from both ends of an array by finding the minimum-sum subarray of size n-k in the middle.
Read →
All Posts
1276 articles
dsa1 min read
Count Number of Nice Subarrays [Medium] — atMost(k)−atMost(k−1)
Count subarrays with exactly k odd numbers using the at-most(k) minus at-most(k-1) sliding window formula.
Read →
dsa1 min read
Binary Subarrays With Sum [Medium] — Prefix Sum / atMost
Count binary subarrays with exactly the given sum using prefix sum with HashMap or the atMost(k)-atMost(k-1) trick.
Read →
dsa1 min read
Frequency of the Most Frequent Element [Medium] — Sorted Window
Find the maximum frequency of any element after at most k increments by sorting and using a sliding window with a running sum.
Read →
dsa2 min read
Minimum Operations to Reduce X to Zero [Medium] — Complement Window
Find minimum operations to reduce X to zero from either end by finding the longest middle subarray with sum = total-X.
Read →
Page 121 of 256