Binary Shuffle

CodeChefOpen on judge ↗

An Imaginary machine which takes input in binary number system and shuffles the digits (without changing the total no. of $1$s and $0$s) and gives the output by changing the number into decimal number system. Given an array of size $N$ containing $0$s and $1$s. Your task is to calculate the smallest possible decimal no. that can be formed after shuffling. ###Input: - First l

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