
Asked in Standard Chartered
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.
Be the first one to answer
Add answer anonymously...
Top Software Developer Interview Questions Asked at Standard Chartered
Q. Explain Encapsulation.
Q. How do you call a REST API?
Q. Why are you leaving your current job?
Interview Questions Asked to Software Developer at Other Companies
Top Skill-Based Questions for Standard Chartered Software Developer
Algorithms Interview Questions and Answers
250 Questions
Data Structures Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Software Development Interview Questions and Answers
250 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

