Greedyyyy, ⌛: 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: $$O(N)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    string getSmallestString(string s, int k) {\n        for (int i = 0; i < s.size(); i++) {\n            int dist_a = min(s[i] - \'a\', \'z\' + 1 - s[i]); // distance to \'a\'\n            if (dist_a <= k) { // can be changed to \'a\'\n                s[i] = \'a\';\n                k -= dist_a;\n            } else {\n                s[i] -= k;\n                k = 0;\n            }\n        }\n\n        return s;\n    }\n};\n```\n\n---\n# If you have any question or advice, welcome to comment below.
['String', 'Greedy', 'C++']