Simple Brute Approach || Beginner's Friendly
 # Intuition  \n\n\n\n\n\n# Complexity\n- Time complexity: O(t)\n\n\n- Space complexity: O(26)\n\n\n# Code\ncpp []\nclass Solution {\npublic:\n    int lengthAft
<!-- # 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: O(t)\n\n\n- Space complexity: O(26)\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        vector<long long> nums(26, 0);\n        long long mod=1000000007;\n        for(char& ch:s) {\n            nums[ch-\'a\']++;\n        }\n        \n        while(t--) {\n            vector<long long> n=nums;\n            long long temp=nums[25];\n            temp=temp%mod;\n            nums[0]=0;\n            for(int i=1; i<26; i++) {\n                nums[i]=n[i-1];\n                nums[i]=nums[i]%mod;\n                \n            }\n            nums[0]+=temp;\n            nums[0]=nums[0]%mod;\n            nums[1]+=temp;\n            nums[1]=nums[1]%mod;\n        }\n        long long ans=0;\n        for(long long& num:nums) {\n            ans+=num;\n            ans=ans%mod;\n        }\n        return ans;\n    }\n};\n```
['Math', 'C++']