My solutions to common interview questions.
hasUniqueCharacters: Determine if a string has all unique characters.isPalindrome: Determine if a string is a palindrome.rotateMatrix: Given an NxN matrix array of ints, rotate the matrix 90 degrees clockwise.compressString: Write a string compression algorithm that uses the count of sequential characters to shorten the string.- e.g. "aabbcccdd" -> "a2b2c3d2"
queueFromStacks: Implement a queue using two stacks.