Binary Subsequence

CodeChefOpen on judge ↗

You have a binary string $s$ of length $N$. What is the length of the shortest subsequence of $s$ that needs to be erased for the resulting string to be non-decreasing? ###Input: - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows. - The first line of each test case contains a single integers $N$. - The

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