class Solution {
public:
vector<int>diffWaysToCompute(string input){
vector<int>res;for(int i =0; i < input.size(); i ++){char c = input[i];if(c =='+'|| c =='-'|| c =='*'){auto res1 =diffWaysToCompute(input.substr(0, i));auto res2 =diffWaysToCompute(input.substr(i +1));for(auto r1 : res1){for(auto r2 : res2){if(c =='+')
res.push_back(r1 + r2);elseif(c =='-')
res.push_back(r1 - r2);elseif(c =='*')
res.push_back(r1 * r2);}}}}if(res.empty())
res.push_back(atoi(input.c_str()));return res;}};
class Solution {
public:
bool isAnagram(string s, string t){
vector<int>hash(26,0);for(auto c : s)
hash[c -'a']++;for(auto c : t)
hash[c -'a']--;for(int i =0; i <26; i ++)if(hash[i])return false;return true;}};