LeetCode || Valid Anagram

class Solution {public:    bool isAnagram(string s, string t) {                if(s.size() != t.size())            return false;                    int bVisited[30] = {0};        for(int i = 0;i<s.size();i++)        {            bVisited[s[i]-'a']++;        }                for(int i = 0;i<t.size();i++)        {            if(bVisited[t[i]-'a'] == 0)                return false;            bVisited[t[i]-'a']--;        }                return true;    }};