1. First create an array storing the count of each of the characters in the first string.
2. Scan the second string. For each character encounterd, decrement the respective count from the stored count array obtained in step 1.
3. If a character is encountered more often than desired, the strings are not permutations of each other.
