Minimum Moves

CodeChefOpen on judge ↗

Chef is very fond of strings. He gave you two strings $A$ and $B$. You have to make both the strings equal using minimum no. of moves. In one move, you can delete the first (leftmost) character of any of the two strings. After applying the move, the length of that string reduced by $1$. Suppose you have the following strings: "akshit" and "sumit", - By applying a move on the string "akshit"

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