Count of Smaller Numbers After Self
HardDivide and ConquerDivide and Conquer
Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.
Practice this as a mock interviewFree to start, no account neededProblem
Given an integer array nums, return an integer array counts where counts[i] is the number of smaller elements to the right of nums[i].
Examples
Input: nums = [5,2,6,1]
Output: [2,1,1,0]
To the right of 5 there are 2 smaller elements (2 and 1). To the right of 2 there is only 1 smaller element (1). To the right of 6 there is 1 smaller element (1). To the right of 1 there are 0 smaller elements.
Input: nums = [-1]
Output: [0]
Input: nums = [-1,-1]
Output: [0,0]
Constraints
- 1 <= nums.length <= 10^5
- -10^4 <= nums[i] <= 10^4
What the interviewer grades
A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.