- 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.
-
Notifications
You must be signed in to change notification settings - Fork 0
Design an algorithm which shortens a string into a shorter string. Write this function in JS. 1. 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) 2. The shortening algorithm should be non-conflicting, i.e. no 2 differen…
heysaurabhkumar/shortenString
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Design an algorithm which shortens a string into a shorter string. Write this function in JS. 1. 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) 2. The shortening algorithm should be non-conflicting, i.e. no 2 differen…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published