This repository was archived by the owner on Sep 22, 2021. It is now read-only.

Description
Description of the Problem
Given two strings s and t , write a function to determine if t is an anagram of s.
Example 1:
Input: s = "anagram", t = "nagaram"
Output: true
Example 2:
Input: s = "rat", t = "car"
Output: false
Note:
You may assume the string contains only lowercase alphabets.
Follow up:
What if the inputs contain unicode characters? How would you adapt your solution to such case?
Code
class Solution:
def isAnagram(self, s: str, t: str) -> bool:
Link To The LeetCode Problem
LeetCode