Challenge string compression

Question

Write a method that compress a string by the counts of consecutive chars.

For example : aaabbbbccd - > a3b4c2d

You can assume the string contains only letters.

Have fun!

Answer 1

https://code.sololearn.com/cgIY560sI6qd/?ref=app

Answer 2

Oneliner :
https://code.sololearn.com/cRBXDMIYKi11/?ref=app

Answer 3

@nitzan
Do you mean on consecutive repeating characters?

For example, what is output for : "aaabbcddddad"?
Output 1: a3b2cd4ad
Output 2: a4b2cd5

Answer 4

https://www.sololearn.com/Discuss/769959/?ref=app

Answer 5

My js try
https://code.sololearn.com/WWnJ2t8zG0CP/?ref=app

Answer 6

It counts any character.
https://code.sololearn.com/cKd9YSs37Q03/#c

Answer 7

Yes I mean consecutive

Answer 8

https://code.sololearn.com/chx76wAt1C7v/?ref=app

Answer 9

https://code.sololearn.com/chs3l5N0ocxz/?ref=app

Answer 10

one liner
https://code.sololearn.com/c5Cbhz4N6uqR/?ref=app

Answer 11

Didn't see that