242. Valid Anagram
Solution
Implementation
class Solution {
fun isAnagram(s: String, t: String): Boolean {
if (s.length != t.length) return false
val letterMap = mutableMapOf<Char, Int>()
for (i in 0 until s.length) {
val (si, ti) = s[i] to t[i]
letterMap[si] = letterMap[si]?.let { it + 1 } ?: 1
letterMap[ti] = letterMap[ti]?.let { it - 1 } ?: -1
}
for (value in letterMap.values) {
if (value != 0) return false
}
return true
}
}