Check Permutation Problem

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

Explanation:

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

Input:

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

Output:

Returns 'true' if the two strings are permutations of each other, otherwise returns 'false'.

Example:

Input:
str1 = 'sinrtg'
str2 = 'string'

Output:
true

Explanation:
The characters in str1 can be rearranged to form str2.

Constraints:

• 0 <= N <= 10⁶, where N is the length of the input string.
• All input string characters are in lowercase.
• Time Limit: 1 second

Note:

Implementation only; no need for input/output operations.