Microsoft | OA | Lexographically Largest Compressed String

Question: There is a string of length N made only of letters "a". Whenever there are two identical adjacent letters (e.g. "aa"), they can be transformed into a single letter that...