easy c++ solution, using hashmap
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int lengthAfterTransformations(string s, int t) {\n        int mod = 1e9+7;\n        unordered_map<char,long long>mp;\n        int ans = 0;\n        for(char c: s) mp[c]++;\n        for(int i = 0; i<t; i++){\n            long long newA =0, newB = 0;\n            if(mp.find(\'z\')!=mp.end()){\n                newA = mp[\'z\'];\n                newB = mp[\'z\'];\n            }\n\n            for(int j = 24; j>=0; j--){\n                mp[(j+1)+\'a\'] = mp[j+\'a\'];\n\n\n            }\n            mp[\'a\'] = newA;\n            mp[\'b\'] = (mp[\'b\']+newB)%mod;\n        }\n        for(auto i: mp){\n            ans = (ans+i.second)%mod;\n        }\n        return ans;\n        \n    }\n};\n```
['Hash Table', 'C++']