Pergunta de entrevista da empresa Bloomberg

Solve the problem in HackerRank code live. 10-15 min introduction with interviewer and 30 min to solve the problem. Problem was CandyCrush problem, to write program such that for given string, if three or more repeating adjacent alphabets can be removed. Initially, I was solving this without recursion approach, it got mess up after removing the substring of repeating string, then, when returned, it may be have again the repeating strings like "abbbaac" => "aaac" = "c".