1. Find if a string has all unique characters.
2. Find if one string is permutation of another given string.
3. Replace all spaces in a string by %20.
4. Check if the given string is a permutation of a palindrome or not.
5. Check if the given string is one edit away from another string.
6. Perform a basic string compression using the counts of repeated characters. If the "compressed" string would not become smaller than the original string, then return the original string.
7. Rotate NxN matrix 90 degrees (in place)
8. Write an algorithm such that if an element in a MxN matrix is zero, its entire row and column is set to zero