Count of Smaller Numbers After Self
Hard · Binary Search Trees · about 35 minutes
Asked at Google, Amazon, Microsoft, Bloomberg, Meta.
For each position i of nums, count how many values further right are strictly less than nums[i]. Return those counts as an array.