Greedy_______________________________________AVS
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```\nclass Solution {\npublic:\n    string smallestString(string s) {\n        int done=0;\n        for(int i=0;i<s.size();i++){\n          if(s[i]==\'a\'&&done)break;\n          else if(s[i]==\'a\')continue;\n          char ch=s[i];\n          ch--;\n          s[i]=ch;\n          done++;\n        }\n        if(done==0)s[s.size()-1]=\'z\';\n        return s;\n    }\n};\n```
['String', 'Greedy', 'C++']