Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

Counting Sort

Sort the array in non-decreasing order using counting sort in O(n + k) time.

Constraints

1 <= n <= 10^5 0 <= nums[i] <= 10^5

Discussion

No discussions yet.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.