Beginner approach
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    const int MOD = 1e9 + 7;\n    int lengthAfterTransformations(string s, int t) {\n        int n = s.length();\n        vector<int>count(26);\n\n        for(char&ch : s){\n            count[ch - \'a\']++;\n        }\n\n        for(int i=0; i<t; i++){\n            int zCount = count[25];\n            for(int j=25; j>1; j--){\n                count[j] = count[j-1];\n            }\n\n            count[1] = (count[0] + zCount)% MOD;\n            count[0] = zCount;\n        }\n\n        long long result = 0;\n        for(auto& c : count){\n            result += c;\n        }\n\n        return result % MOD;\n    }\n};\n```
['Hash Table', 'String', 'C++']