Pergunta de entrevista da empresa Citi
Given a string, write code that reverses only the alphabet characters of the string in the most efficient way. Example: a$1b^c -> c$1b^a
Resposta da entrevista
Sigiloso
2 de dez. de 2017
I will give the pseudo code here: int len=string.length() int start=0, end=len; while(start='a'&&string[start]='A'&&string[start]='a'&&string[end]='A'&&string[end]<='Z')) end--; if(start