Leetcode 1365. How Many Numbers Are Smaller Than the Current Number

For each element in an integer array, return how many elements in the array are strictly smaller than it. With n ≤ 500 and values in [0,100], this is typically solved by ranking via sorting or by using frequency counts and prefix sums for O(n + range) time.