C# fast solution, clean code using Dictionaries beats 97%
Complexity\n- Time complexity: O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(n)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: $$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(n)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public bool IsAnagram(string s, string t) {\n        if (s.Length != t.Length) {\n            return false;\n        }\n\n        var symbolFrequency = new Dictionary<char, int>();\n        for (int i = 0; i < s.Length; i++) {\n            symbolFrequency.TryAdd(s[i], 0);\n            symbolFrequency.TryAdd(t[i], 0);\n\n            symbolFrequency[s[i]]++;\n            symbolFrequency[t[i]]--;\n        }\n\n        return symbolFrequency.Values.All(frequence => frequence == 0);        \n    }\n}\n```
['C#']