otobrglez/compression-puzzle

Attempts to crack the "compression puzzle".

compression-puzzle's Issues

Ambiguous Requirements with regards to double digit output

Related to my comment #28 (comment)

there is slight ambiguity in output produce by the program. consider this input:

AAAAAAAAAAA could produce 11A

now imagine digit in the input: 1 will produce 11

This means that output for the input 111x A sequence would be the same as for 1A (111A).

This is not a problem given there is only one simple example but it sort of makes it hard to say how would truly correct implementation look like.

Common test suite

It would make sense to run a common test suite against all the solutions through stdin or something like that. Either that or make the solutions also test the empty case (compress("") == ""). I've ran into solutions where the empty case resulted in compress("") == "0" while prototyping, and I wouldn't be surprised if some existing or future submissions had the same issue.

Python scripts don't seem to get invoked

It seems python3 doesn't run scripts with

python3 src/python/*.py 

like it's written in the make file. Maybe there is a more elegant solution but this works

find src/python/ -name "*.py" -print0 | xargs -0 -n 2 python3

Single character compressions

In the example, There is only 1 C that gets compressed into 1C. If we take the knowledge that all "multi character" will have a number, and all singles do not have this prefix number, we can improve the compression ratio of this problem

The "Wanted" Languages

In what other languages would you like to see solutions, and do you know anyone who could provide them?

I would be interested to see Kotlin solution. There are probably some Android devs that use it. And Rust, and Julia ...