Given a compressed string, give the number of ways it can be decompressed.
- A compressed string is a string where substrings of repeated characters are changed to a format similar to aaa -> a3
- For example for the string aaabbhhhh33aaa the compressed string would be a3b2h432a3
As an example of counting decompressing options. Say you have the input a333b2. This can be read as a333 b2 or a3 33 b2 so you would need to return the value 2 as there are 2 options.
You must accept the input as a command line argument (entered when your app is ran) and print out the result
(It will be called like node main.js aaaaa or however else to run apps in your language)
You can use the solution tester in this post to test you followed the correct format https://programming.dev/post/1805174
Checking through the solutions of last weeks problems should be happening this weekend monday + tuesday. Been getting too much work and theres a game jam thats been going on but should be able to go through them all then. I may do the easy one last since it cant be checked using the solutions tester so that one will take a bit longer.
Will also try to go through and give solutions to these ones as well on the weekend and will try to do solutions as soon as possible from now on so you can see if you failed the test cases. For the ones done last week, after I go through them all ill give 1 extra day from then on for any resubmissions
A bit late to the party but here’s a Rust solution that is probably maybe correct: https://pastebin.com/Eaes7hU9