Sanket string compression

#1

2 testcase wrong ans

#2
  1. check the containt string can be of length 1000 and u have take array of 100
  2. if only 1 occurence then u dont have to put 1
#3

if i change what you suggest it made all test case wrong answer

#4

check this
its and o(n) approach with satisfying above points

#5

@fokvat your code is producing wrong output.
I think you have understood the question in a wrong way.

For the input: aabbaabb
The output of your code: a4b4
The expected output: a2b2a2b2

Hope, this would help. If you still have doubts, feel free to ask.

#6

after putting your code it ehow wrong ans to all cases

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.