CROSSWORD PUZZLE

CodeChefOpen on judge ↗

A puzzle contains a binary string of length $y$. An encryption of this word is an array of size $n$, where $n$ is the number of chunks(i.e. partitions) formed completely of $O$, and $ai$ is the length of the $i$-th partition. No two partitions can touch or overlap. For example- * If y=6 and the word is $OOXOOO$, then its encrypted array is {2, 3} * If y=5 and the word is $OOOOO$, then its encryp

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