Daffodil International University
Judge online · C (gcc / clang)
DIU
ContestHub
C practice · live contests
Problems
Leaderboard
Contests
Log in
Register
Sets
/
Set 5
Set 05
Sorting Fundamentals
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
Q1
Sort Ascending
VERY EASY
Q2
Kth Smallest
EASY
Q3
Sort by Custom Rule
MEDIUM
Q4
Minimum Swaps to Sort
MEDIUM-HARD
Q5
Merge Two Sorted Arrays In-Place-Style (K-way idea)
HARD
Q6
Count Inversions
VERY HARD
Q7
K-Way Merge of Sorted Lists (min-heap based)
EXTREME
← Set 4
Set 6 →
Set 5 · Sorting Fundamentals · DIU ContestHub