Minimum Absolute Score
You are given two strings $A$ and $B$ of length $N$ consisting of lowercase English letters. Your objective is to make both the strings equal. You can apply one of the following $2$ operations at each index $i$: - Convert char $A_i$ to $B_i$ by doing right cyclic shift of character $A_i$. This **increases** your score by amount equal to cyclic shifts done. - Convert char $B_i$ to $A_i$ by doing r
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