Practice Problems

Daily Challenge: Paths Around the Walls (1500) Solve it to start a streak

sorting Problems

49 practice problems tagged sorting , from difficulty 900 to 1700 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: greedy math two-pointers intervals implementation strings heap divide-and-conquer binary-search graphs

ProblemTopics Solvers Acceptance Difficulty
Sort the Words strings sorting 0 — 900
K-th Smallest sorting 0 — 1000
Lower Median sorting 0 — 1000
Evens First, Order Kept implementation sorting 0 — 1000
Closest Two Values greedy sorting 0 — 1000
Same Multiset sorting 0 — 1000
Order by Last Digit sorting 0 — 1000
Shortest Words First strings sorting 0 — 1000
Sort the Flag sorting two-pointers 0 — 1000
Sort by Absolute Value sorting 0 — 1100
Widest Gap sorting 0 — 1100
Top K Values heap sorting 1
50%
1100
Order by Digit Sum sorting 0 — 1100
Order by Set Bits sorting 0 — 1100
Login Streak sorting 0 — 1100
Content Children greedy sorting 0 — 1200
One Meeting Room intervals sorting 0 — 1200
Make Everyone Equal math sorting 0 — 1200
Rank Transform sorting 0 — 1300
One Swap Away implementation sorting 0 — 1300
First Value At Least X binary-search sorting 0 — 1300
K Most Frequent heap sorting 0 — 1300
Cover the Demands greedy sorting 0 — 1300
Wave Arrangement sorting 0 — 1300
Best Product of Three math sorting 0 — 1400
Reverse One Segment implementation sorting 0 — 1400
Merged Interval Count intervals sorting 0 — 1400
Total Covered Length intervals sorting 0 — 1400
Best Pairing greedy sorting 0 — 1400
Best Dot Product greedy sorting 0 — 1400
Worst Dot Product greedy sorting 0 — 1400
Closest Pair Sum to Zero sorting two-pointers 0 — 1400
March to the Median math sorting 0 — 1400
K Nearest Values sorting two-pointers 0 — 1400
Merged Timeline intervals sorting 0 — 1400
Closest Pair Sum sorting two-pointers 1
100%
1500
Minimum Swaps to Sort math sorting 0 — 1500
The Busiest Moment intervals sorting 0 — 1500
Three That Sum to T sorting two-pointers 0 — 1500
All the Gaps math sorting 0 — 1500
Sum of Pair Minimums math sorting 0 — 1500
Sum of Pair Maximums math sorting 0 — 1500
Minimize the Worst Delay greedy sorting 0 — 1500
Count the Inversions divide-and-conquer sorting 0 — 1600
Largest Concatenation greedy sorting 0 — 1600
Smallest Impossible Sum greedy sorting 0 — 1600
Schedule the Courses graphs sorting 0 — 1600
Zero Triplets sorting two-pointers 0 — 1600
Smaller Ones Before Me fenwick sorting 0 — 1700