Zero Ones Equal One Zeros
Kulyash believes in equality. Given an integer $N$, output a binary string of length $N$ such that: - The count of $01$ [subsequences](https://en.wikipedia.org/wiki/Subsequence) in the string is **equal** to the count of $10$ subsequences; - The string has **at least** one occurrence of $0$ as well as $1$. If multiple such strings exist, print any. Also, it is guaranteed that corresponding to
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.
Sign in to chat with the tutor and save your progress.
Sign in to start