Largest First

CodeChefOpen on judge ↗

The chef has a number N, Cheffina challenges chef to form the largest number X from the digits of N. ###Input: - First-line will contain $T$, the number of test cases. Then the test cases follow. - Each test case contains a single line of input, $N$. ###Output: For each test case, output in a single line answer. ###Constraints - $1 \leq T \leq 10^5$ - $1 \leq N \leq 10^6$ #

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