Check Permutation Problem Statement

Determine if two given strings, 'str1' and 'str2', are permutations of each other.

Explanation:

Two strings are permutations of each other if one string's characters can be rearranged to form the other.

Input:

The first line contains the string 'str1'.
The second line contains the string 'str2'.

Output:

'true' or 'false'

Example:

Example Input:

str1 = "sinrtg"
str2 = "string"

Example Output:

true

Constraints:

• 0 <= N <= 10^6, where N is the length of the input string.

Note:

All characters in the input strings are lowercase.
You do not need to print anything; implement the function.