- It is given that input strings are alphabets only and provided in small case only (for eg starwars). This should get shortened to something smaller (output can be alphanumeric)
- The shortening algorithm should be non-conflicting, i.e. no 2 different input strings should result in same shortened output string.
- Also write the reverse operation, if I enter a shortened string, it can decode and provide the original full string.