MIXED CANDIES

CodeChefOpen on judge ↗

Chef is in trouble as the dishes are mixed by his assistant. The dishes are of types 0's and 1's. Help chef by seperating the dishes. ### Input The first line consists of T - the number of testcases For every test case: The first line consists of N - total number of dishes. Next line consists of N dishes seperated by spaces ### Output For every test case print all the 0-type dishes followed

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