242. Valid Anagram

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?

# @lc code=start
using LeetCode
using DataStructures
function is_anagram(s::String, t::String)::Bool
    length(s) != length(t) && return false
    count_s, count_t = DefaultDict{Char,Int}(0), DefaultDict{Char,Int}(0)
    for i in eachindex(s)
        count_s[s[i]] += 1
        count_t[t[i]] += 1
    end
    return all(count_s[c] == count_t[c] for c in 'a':'z')
end

# @lc code=end

is_anagram (generic function with 1 method)

This page was generated using DemoCards.jl and Literate.jl.