LeetCode 493: Reverse Pairs
A clear explanation of counting pairs where nums[i] is greater than twice nums[j] using merge sort.
4 notes
A clear explanation of counting pairs where nums[i] is greater than twice nums[j] using merge sort.
A clear explanation of Count of Smaller Numbers After Self using coordinate compression and a Fenwick Tree.
A clear explanation of Range Sum Query 2D - Mutable using a 2D Fenwick Tree for efficient updates and rectangle sum queries.
A clear explanation of Range Sum Query - Mutable using a Fenwick Tree for efficient updates and range sums.