isUnique - Are all characters in a string unique
Make an array of 128 booleans (ASCII) and set for each char value
Given two strings, design a method to tell if one is a permutation of the other
Sort the strings and return if they’re equal
Determine if a string is a permutation of a palindrome
Put each character in a hashtable with character count association, then loop through hash table making sure that no more than 1 character contains an odd number of occurrences.
Determine if two strings are one change away from being equal to each other
Check the length of each string to determine which operation we’ll need to use (insert/replace)