← All problemsSign in

Fitness Freak DJ

DJ is a fitness freak. He keeps records of all his walks(or rather sprints!).He ranks them according to the number of steps each walk in descending order. He being modest, decides not to keep the best walk in his so called "Walk of fame",but rather the walk whose rank is floor of n/3, where n is the total number of walks till now.Since you are his comrade you are assigned the task of storing all h

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