leetcode

242. Valid Anagram

Map solution

• Java code
• Python code

n = |s, t|

Time complexity: O(n)

Space complexity: O(n)

Alphabet solution

• Java code

n = |s, t|

Time complexity: O(n)

k = |alphabet| = 26

Space complexity: O(k)