Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1365. How Many Numbers Are Smaller Than the Current Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source