1) Given 2 strings, remove every instance of every letter in the second string from the first string. Then do it without shifting letters in the first string or creating another string.
2) What is the most efficient way of checking if a letter in the second string is in the first string in the previous problem? What if you're using all ASCII characters? What if you're using the entire Unicode character set?

Question

1) Given 2 strings, remove every instance of every letter in the second string from the first string. Then do it without shifting letters in the first string or creating another string.  
2) What is the most efficient way of checking if a letter in the second string is in the first string in the previous problem? What if you're using all ASCII characters? What if you're using the entire Unicode character set?

David · Accepted Answer

What is the answer to this question???pleassse especially without creating a decond string

Sigiloso · Answer

Thought it wasn't too hard overall

Microsoft

Pergunta de entrevista da empresa Microsoft

Respostas da entrevista

Empresas seguidas

Buscas de vagas