One lovely Friday we were faced with this nice yet intriguing programming puzzle.
One shall write a program that compresses string "AAABBAAC" to its compressed form "3A2B2A1C".
These attempts were made,...
- No external libraries or tools shall be used. Only standard, bundled libraries apply.
- "Assert" inside your solution if the function does what it is suppose to do.
- You can apply as many solutions as you want to any language you want.
- Assume that the input is always a sequence of ASCII upper-case characters (no numbers or symbols).
- What if my language is not yet supported? No problem. Just pretend that it does and provide some instructions on how can it be ran in the PR. We'll try to use the wizzardy of Nix and/or Docker to compile and run it along with others.
- Can I submit multiple solutions? Yes; please do.
- Should we benchmark the solutions agains each other? Possibly.
- Why are you doing this? Because its fun!
- Will there be any recap/summary/article written? Hopefully, yes.
- How can I contact you? Try @otobrglez on Twitter or via GitHub issues or something.
# Via Nix Shell
$ nix-shell shell.nix --run "make run"
# if you preffer to roll your own local brew
$ makeTo run individual languages use:
make bash
make clojure
make elixir
make fs
make go
make haskell
make javascript
make kotlin
make python
make rescript
make ruby
make rust
make rye
make scala
make sqlite
make typescriptAlthough benchmarking is not the primary goal of this project; some authors are really kean to measure the performance of their solutions and compare them to others.
These languages have benchmarking suites made and feel free to give the ma try.
# Python
python src/python/benchmarks.py
# F#
./src/fsharp/benchmark.fsxP.s.: If you feel the urge that you need to benchmark your solution agains others; please feel free to do so and attach some instructions to your PR.