When History Offers a Hand
CodeChefOpen on judge ↗
Cooper is trying to decipher the strange dust patterns in Murphy’s room. He observes that there are two patterns repeating, and he decides to write them as binary strings having ‘a’ and ‘b’. He now obtains two strings of equal length $N$, where $N$ is even. Now to process this, he needs to make both the strings palindromic, which he wants you to do. He thus gives you the strings. You are giv
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