← All problemsSign in

Professor vs Alicia

We are in a parallel universe and Inspector Alicia and Professor loves each other, as somethings never change both try to outsmart each other every time. This time Professor gave Alicia a very difficult problem to solve. The question is that you will be given two binary strings $a$ and $b$ of the same length $N$. You can perform the following two operations on string $a$: $1)$ Swap any two bits a

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

Sign in to chat with the tutor and save your progress.

Sign in to start