dsa1 min read
Count Smaller Numbers After Self — Merge Sort or Binary Indexed Tree
Count smaller elements to the right of each element using merge sort with position tracking in O(n log n).
Read →
All Posts
1276 articles
dsa1 min read
Russian Doll Envelopes — Sort + LIS Binary Search
Find the maximum number of nested envelopes by sorting by width ascending then height descending, then applying LIS.
Read →
dsa1 min read
Minimize the Maximum of Subarrays After Splits — BS on Answer
Minimize the maximum value after performing k operations (average adjacent elements) using binary search on the answer.
Read →
dsa1 min read
Cutting Ribbons — Binary Search on Answer (Length)
Find the maximum length to cut k ribbons from given ribbons using binary search on the ribbon length.
Read →
dsa1 min read
Maximum Value at Given Index — Binary Search on Peak Value
Maximize nums[index] given array length n, sum constraint maxSum, and each element >= 1 using binary search on the peak value.
Read →
Page 26 of 256