ntree.aiValid Anagram
Valid Anagram
easysolvedattempted
Given two strings s and t, return true if t is an anagram of s, and false if it is not.
An anagram uses exactly the same characters the same number of times.
Example 1:
Input: s = "polo", t = "loop"
Output: true
Example 2:
Input: s = "aacc", t = "ccac"
Output: false
Constraints:
1 <= length of s <= 10^51 <= length of t <= 10^5sandtconsist of lowercase English letters
def isAnagram(s: str, t: str) -> bool: pass Press Visualise to step through your code.