class Solution {
public:
int minSteps(string s, string t) {
unordered_map<char,int>hash1;
unordered_map<char,int>hash2;
for(int i = 0; i < s.size(); i++)
{
hash1[s[i]]++;
hash2[t[i]]++;
}
unordered_map<char,int>::iterator it;
int res = 0;
for(it = hash1.begin(); it != hash1.end(); it++)
{
if(hash2[it->first] < it->second)
res += it->second - hash2[it->first];
}
return res;
}
};