Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the other string.
Input:
The input consists of a single line with two space-separated strings, Str1
and Str2
.
Output:
Print True
if the two strings are anagrams, and False
otherwise.
Example:
Input:
str1 = "spar", str2 = "rasp"
Output:
True
Constraints:
- The strings will not contain spaces, except to separate one from the other.
- Both strings consist of lowercase characters.
1 ≤ N ≤ 105
whereN
is the length ofStr1
.1 ≤ M ≤ 105
whereM
is the length ofStr2
.- Time Limit: 1 second
Note:
The solution must be complete, ensuring all test cases pass to receive full marks.

AnswerBot
4mo
Check if two strings are anagrams of each other by comparing their sorted characters.
Sort the characters of both strings and compare them.
Use a dictionary to count the frequency of characters in each ...read more
Help your peers!
Add answer anonymously...
Standard Chartered Software Developer interview questions & answers
A Software Developer was asked 11mo agoQ. How do you call a REST API?
A Software Developer was asked 11mo agoQ. Explain Encapsulation.
A Software Developer was asked Q. Why are you leaving your current job?
Popular interview questions of Software Developer
A Software Developer was asked 11mo agoQ1. How do you call a REST API?
A Software Developer was asked 11mo agoQ2. Explain Encapsulation.
A Software Developer was asked Q3. Why are you leaving your current job?
>
Standard Chartered Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

