very easy Java Solutiom
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) due to while loop\n- Space complexity:\nO(n) 1 char array of size n\n# Code\n```\nclass Solution {\n    public String smallestString(String s) {\n        int i=0,n=s.length();\n       char[] A=s.toCharArray();\n       while(i<n && A[i]==\'a\'){\n           i++;\n           if(i==n) A[n-1]=\'z\';\n       }\n       while(i<n && A[i] !=\'a\'){\n           --A[i++];\n       }\n       return String.valueOf(A);\n\n    }\n}\n```
['Java']