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 where N is the length of Str1.
  • 1 ≤ M ≤ 105 where M is the length of Str2.
  • 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
Select
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?
Software Developer Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
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

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits