Derek Wolpert

Anchor Challenge

Visit the GitHub repo for this project

Enter in text:

Select a minimum length:

The largest unique set of characters that can be removed without letting the text's length drop below 50 are:

"0", "5", "I", "y", "j", "k", ",", "'", ":", "q", "v", ".", "d", "b", "f", "w", "m", "c", "n", "p", "g", "u", "i", "l", "s", "h", "o", "r", "a" & "e"

When the characters from the set are removed the text reads:

" t t tt t t t t t tt t tt tt t t t t tt t tt tt t t "