Bit Play
Chefina has a binary string $S$ of **odd** length $N$. She also has an operation string $o$ of length $\frac{(N-1)}{2}$ where $o_i \in \{\&, |, \oplus\}$. Note that $\&, |, \oplus$ denote the bitwise [and](https://en.wikipedia.org/wiki/Bitwise_operation#AND), [or](https://en.wikipedia.org/wiki/Bitwise_operation#OR), and [xor](https://en.wikipedia.org/wiki/Bitwise_operation#XOR) operations respec
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