Anagram Conversion

Problem Statement

Anagram Conversion Problem Description Given a string consisting solely of digits, modify the first half of the string to become an anagram of the second half. Determine the minimum number of operations required to achieve this. In one operation, replace any digit in the string with any other digit (0-9). For example, if s = '123212' , the first half is '123' and the second half is '212'. Changing the '3' in the first half to '2' results in '122', which is an anagram of '212'. This requires 1 operation. Function Description Complete the function getAnagram in the editor with the following parameter: string s : a string of digits Returns: int : the minimum number of operations needed to make the string's first half an anagram of its second half Examples Example 1: Input: s = '123456' Output: 3 Explanation: The first half, '123', can be converted to '456' in 3 operations. Converting it to '465', '546', '654', etc. would also work, but in all cases, it requires 3 operations. Example 2: In