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 value. Note: 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 Format The first line contains the string A . The second line contains the string B . (inferred — the source gives the function-style specification input1 : A string A and input2 : A string B ; the house convention of one value per line is used for stdin) Output Format Print the leftover string in A after removing all the letters that exist in string B, or Empty if nothing is left. Constraints 1 <= length of A <= 17000 (inferred — no bound appears in the capture; this one keeps the printed answer inside the output limit) 1 <= length of B <= 150000 (inferred — no bound appears in the captur