Min Changes

CodeChefOpen on judge ↗

You are given two strings s1 and s2, both of which only contain lowercase Latin letters(between a and z). You want to make string s1 a permutation of string s2. However, you want to do so in the minimum number of operations, and you can only perform two kinds of operations on s1. Add any one character in s1. Delete any one character from s1. For Example: S1 = “abbca” S2 = “abcdb” Here you shoul

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