**Objective:** Given Two Strings, check whether one string is a permutation of other

**Input:** Two Strings

**Output: **True or false based on whether strings are permutations of others or not.

**Example: **

"sumit" and "tiums" are permutations of each other. "abcd" and bdea" are not permutations of each other.

**Approach:**

**Method 1: Time Complexity – O(nlgn)**