Algorithm · Bloomberg · Easy
You are given two strings s and t. Both have the same length and are made up solely of lowercase English letters. A single step lets you pick any one character of t and change it into some other lowercase letter. Your goal is to turn t into an anagram of s — that is, a string containing exactly the same letters as s with the same multiplicities, possibly in a different order. Return the smallest number of steps required to achieve this. Example 1: Explanation: Changing one…