Sort Meals

CodeChefOpen on judge ↗

Given an array $Arr$ with $N$ meals, namely, Breakfast, Lunch and Dinner. Sort them such that meals of the same time are adjacent. Use the integers 1, 2, and 3 to represent the meals Breakfast, Lunch and Dinner respectively. You must solve this problem without using the library's sort function and in O(n) time. ### Input - First line will contain $T$, number of testcases. Then the testcases fol

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