Clean String

Problem Statement

Clean String You are given two strings A and B . Your task is to find and return a string representing the leftover string in A after removing all the letters that exist in string B . Return "Empty" if the output does not contain any values. Notes Strings A and B contain English alphabets in upper case only. A single alphabet in B can replace all the occurrences of that alphabet in A . Input Specification input1 : A string A input2 : A string B Output Specification Return a string representing the leftover string in A after removing all the letters that exist in string B . Example 1 input1: AABBCC input2: AB Output: CC Explanation Here, the given string A is "AABBCC" and B is "AB". We need to remove all the 'A's and 'B's from string A . After removing 'A's, A becomes "BBCC". After removing 'B's, A becomes "CC". So, the output is "CC". ```