Exercises/#68 Count of Smaller Numbers After Self
#68

Count of Smaller Numbers After Self

HardπŸ” Sorting & Searching
130 XP

Problem

Given an integer array nums, return a count array where count[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]
merge-sortbinary-indexed-treedivide-conquer
AI Assistantβ€” powered by AI

Unlock hints progressively β€” start gentle, go deeper only if needed.

πŸ’‘

Level 1: Gentle Nudge

A subtle direction

πŸ—ΊοΈ

Level 2: Approach

The algorithm to use

πŸ”

Level 3: Detailed

Step-by-step guidance

68 / 150

Your Solution

⚑ JavaScript

to save progress and use AI features