PythonEasyHashing10 min

Check whether two strings are anagrams

Compare exact ASCII characters, including spaces and case. Empty strings are valid. Interviewers use this problem to assess compare character counts rather than sorted strings.

Input

Two lines, one string per line.

Output

Print true or false in lowercase.

Constraints

0 <= each length <= 100000.

Example

Input

listen
silent

Output

true

Example 2 input

a a
aa

Output

true

Spaces count as characters, not separators.

Public test cases (2)

Input
```
listen
silent
```
Expected output
```
true
```
Input
```
rat
car
```
Expected output
```
false
```

Hints (2)

Identify the state needed to avoid repeated work.
Compare character counts rather than sorted strings.

Target complexity: time O(n + m) · space O(k), where k is the number of distinct characters

Your solution

import sys


def solve_anagram_check(s, t):
    # your code
    return False


if __name__ == "__main__":
    data = sys.stdin.read()
    lines = data.split("\n")
    s, t = lines[0], lines[1]
    result = solve_anagram_check(s, t)
    print("true" if result else "false")

Standard input

Checking runner availability…

Reference solution

Check whether a number is prime · Easy
Check whether a string is a palindrome · Easy
Compute the factorial of a number · Easy
Count vowels and consonants · Easy
Find the first occurrence with binary search · Easy
Find the missing number from zero through n · Easy
Find the second largest distinct value · Easy
Generate the Fibonacci series · Easy
Remove duplicate values while preserving order · Easy
Reverse a string · Easy

All Python programs

Check whether two strings are anagrams

Input

Output

Constraints

Example

Public test cases (2)

Your solution

Reference solution

More Python programs