dsa1 min read
Subarrays with K Different Integers [Hard] — Sliding Window Subtract
Count subarrays with exactly K distinct integers using the formula: atMost(K) - atMost(K-1).
Read →
All Posts
1575 articles
dsa1 min read
Minimum Domino Rotations For Equal Row [Medium] — Greedy Check
Find the minimum rotations to make all tops or bottoms equal by checking if a target value (from first domino) can unify the entire row.
Read →
dsa1 min read
Stamping the Sequence [Hard] — Reverse Greedy
Reconstruct the stamp sequence in reverse by greedily finding where the stamp can overwrite current characters in the target string.
Read →
dsa2 min read
Longest Duplicate Substring [Hard] — Binary Search + Rolling Hash
Find the longest substring that appears at least twice using binary search on length and Rabin-Karp rolling hash for O(n log n) average time.
Read →
dsa2 min read
Maximum Frequency Stack [Hard] — Frequency + Group Stacks
Design a stack that pops the most frequent element (breaking ties by recency) using frequency and group-stacks mapping.
Read →
Page 80 of 315