Doubt regarding String Compression problem

#1

Can you tell me the approach to solve this problem.
Do we need to use StringTokenizer to solve this problem ?

#2

a simple approach is through use of stack. each element of the stack is a pair (character,integer), that is a character and its frequency. whenever you encounter same character as the top of the stack, just increment the count. think about it and try to implement it yourself.

Thanks

#3

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.