242. Valid Anagram
Hash Table, String, Sorting ·Problem Statement
link: https://leetcode.com/problems/valid-anagram/ https://leetcode.cn/problems/valid-anagram/
Given two strings s and t, return true if t is an anagram of s, and false otherwise.
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once.
Example:
Input: s = "anagram", t = "nagaram"
Output: true
Input: s = "rat", t = "car"
Output: false
Solution Approach
Algorithm
Implement
class Solution:
return Counter(s) == Counter(t)