mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
a88f0a0b0b
* Add two more test cases for string compress coding challenge. I believe that the existing test cases are not strict enough to assure a proper solution for this challenge. I was able to implement a wrong, but still passing solution to this basing on set and collections.Counter mechanism, since the test cases present only situations with singular occurrences of a letter chain and all the test strings are alphabetically sorted. I believe that the two new test cases enforce more thorough approach to the problem and, in effect, the test cases are more descriptive. * Fix the results in tests since the solution changed in the meantine on original branch. * Update also the test_compress and solution. |
||
---|---|---|
.. | ||
compress | ||
compress_alt | ||
hash_map | ||
permutation | ||
reverse_string | ||
rotation | ||
unique_chars | ||
__init__.py |