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 <= 106, 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.
AnswerBot
11d
Check if two strings are permutations of each other.
Create character frequency maps for both strings.
Compare the frequency maps to check if they are permutations.
Handle edge cases like empty strings o...read more
Help your peers!
Add answer anonymously...
Popular interview questions of Software Developer
>
PropTiger.com Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app