dsa1 min read
Longest Mountain in Array [Medium] — Two Pass Expand
Find the longest mountain subarray (strictly increasing then decreasing) using two separate forward scans for up and down slopes.
Read →
All Posts
1276 articles
dsa1 min read
Longest Turbulent Subarray [Medium] — Two Pointer Direction Track
Find the longest turbulent subarray where comparisons alternate between > and < using two-pointer direction tracking.
Read →
dsa1 min read
Subarrays with K Different Integers [Hard] — atMost(K)−atMost(K−1)
Count subarrays with exactly K distinct integers using the mathematical trick: exactly(K) = atMost(K) - atMost(K-1).
Read →
dsa1 min read
Replace the Substring for Balanced String [Medium] — Two Ptr
Find the minimum length substring to replace so that a string of QWER has equal frequencies, using a shrinkable two-pointer approach.
Read →
dsa2 min read
Min Flips for Alternating Binary String [Medium] — Circular Window
Find minimum character flips to make a binary string alternating by applying a fixed circular sliding window of size n.
Read →
Page 122 of 256