Binary Sort

CodeChefOpen on judge ↗

You are given a binary string $s$ of length $N$ containing '0' or '1'. You can perform one of the following operation on the string given below .... $1.$ If the element is '0', you can remove the element and add to the starting of the string... $2.$ If the element is '1', you can remove the element and add to the end of the string... You can perform any one of the operation many times (possibly

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