Beats100%,O(n)
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:\nO(n)\n\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\npublic:\n    string getSmallestString(string s, int k) {\n       int cnt=0;\n       for(int i=0;i<s.size();i++){\n         int s1=s[i]-\'a\';\n         int s2=26-s1;\n         int num=min(s1,s2);\n         if(num<=k){\n            s[i]=\'a\';\n            k=k-num;\n         }\n         else{\n            s[i]=s[i]-k;\n            k=0;\n         }\n       }\n       return s;\n    }\n};\n```
['C++']