← All problemsSign in

Bobby Sort

Kajol and Bobby are best friends. They are super excited to participate in the ACM ICPC this year and are practicing hard to get through the online round. So they give interesting coding challenges to each other to test their skills. Bobby decides to give Kajol a simple task based on sorting. However it's not the normal sorting of n numbers. Bobby knows that Kajol is weak in primes and hence want

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start