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 →
All Posts
1276 articles
dsa5 min read
Binary Search — Complete Guide: All Patterns & Problem Index
Master every binary search pattern: classic, left/right boundary, rotated array, BS on answer, and 2D matrix — with templates and full index of 45 problems.
Read →
dsa1 min read
Binary Search — Classic Exact Target
Implement classic binary search to find a target in a sorted array in O(log n) time.
Read →
dsa1 min read
First Bad Version — Left Boundary Binary Search
Find the first bad version using left-boundary binary search: shrink hi to mid when version is bad.
Read →
dsa1 min read
Search Insert Position — Left Boundary for Insert Index
Find where a target would be inserted in a sorted array using left-boundary binary search returning lo.
Read →
Page 21 of 256