Solution (leetcode-in-java 1.23 API)

java.lang.Object
- g0201_0300.s0242_valid_anagram.Solution

```
public class Solution
extends Object
```
242 - Valid Anagram.
Easy

Given two strings s and t, return true if t is an anagram of s, and false otherwise.

Example 1:

Input: s = “anagram”, t = “nagaram”

Output: true

Example 2:

Input: s = “rat”, t = “car”

Output: false

Constraints:
- 1 <= s.length, t.length <= 5 * 10⁴
- s and t consist of lowercase English letters.
Follow up: What if the inputs contain Unicode characters? How would you adapt your solution to such a case?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  boolean isAnagram(String s, String t)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

isAnagram

public boolean isAnagram(String s,
                         String t)