Find the minimum number of operations (move, replace, or swap) required to make two given strings identical, with the constraint that elements cannot be moved between strings.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.