Lets create a compression algorithm 🤯 It sounds hard but it's something achievable for almost anyone.

Create an algorithm that given a string, replaces its words matching the symbols dictionary keys and replaces them with their respective values on the same dictionary.

symbols = {
    "implementation": "🤯",
    "practicality": '🤩',
    "better": '😅',
    "Although": "🥺"
}

For example:

The current project has 3 main files:

1. Take time to understand the code, start by opening and reading the app.py and follow the algorithm with your brain, review the compress.py and decompress.py files to understand where your solution must be implemented.
2. Run the app.py by typing python3 app.py and undestand what is the output and why.
3. Edit the compress.py to create the compression algorithm.
4. Test your compression algorithm by running the app.py again.
5. Edit the decompress.py to create the decompression algorithm.
6. Test your decompression algorithm by running the app.py again.

Download/clone the project and type the folloding in the command line:

python3 app.py

You should get a response similar to this:

✅No data lost.
document.txt has 824 size, compressed.txt has 768 size, compression of 7% in 0.0003972053527832031 seconds 

1. Compression power: Ratio is defined as the ratio between the uncompressed size and compressed size.
2. No Data lost: If we compress and decompress document.txt the result should be the original string of content.

By adding more words to the symbols dict you can achieve more compression power.

Try to re-do the algorithm to achieve a compression power above 15% with no data lost without just adding more words.