Case Insensitive Anagram Check

Given two strings, determine if they are anagrams of each other, ignoring spaces and case differences. An anagram is a word formed by rearranging the letters of a different word. Your task is to return 'Yes' if they are anagrams and 'No' otherwise. Input Format: Two lines, the first containing the first string and the second containing the second string. Output Format: 'Yes' if the strings are anagrams; 'No' otherwise. Example: Input: A gentleman Elegant man Output: Yes Explanation: When ignoring spaces and case, both strings contain the same letters.