dsa1 min read
Count of Smaller Numbers After Self — BIT + Coordinate Compress
Count smaller elements to the right of each element. Process from right to left; BIT tracks seen elements. Coordinate compress values to BIT indices.
Read →
All Posts
1575 articles
dsa1 min read
Reverse Pairs — Merge Sort / BIT
Count pairs (i,j) where i<j and nums[i] > 2*nums[j]. Modified merge sort: during merge, count pairs across left/right halves.
Read →
dsa1 min read
My Calendar I — Sorted Dict / Segment Tree
Book events without double-booking. Use sorted dictionary to find previous and next events; check overlap with both.
Read →
dsa1 min read
Range Module — Segment Tree / SortedDict
Track coverage of half-open intervals. addRange, removeRange, queryRange. Sorted dictionary of disjoint intervals with merge/split logic.
Read →
dsa1 min read
Falling Squares — Coordinate Compress + Segment Tree
Simulate falling squares, track tallest stack height. Coordinate compress x-coordinates, use segment tree with lazy propagation for range max.
Read →
Page 145 of 315