Round 3: DSA question almost similar to String Compression(Leetcode). The difference between the question here and the question asked in the interview was that even in the case of a single occurrence of the character, I had to append “a1” instead of “a” given in the question. I was given the input array size = length(string)*2.
Utilisateur anonyme
starting from behind utilizing the auxiliary space of the array will do the question.