✅💯Very Easy | Simple Solution
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 {\n    public int longestBeautifulSubstring(String word) {\n        int len=1;\n        int count=1;\n        int maxLen=0;\n        for(int i=1;i<word.length();i++){\n            if(word.charAt(i-1)<=word.charAt(i)){\n                if(word.charAt(i-1)!=word.charAt(i)){\n                    count++;\n                }\n                len++;\n                if(count==5){\n                    maxLen=Math.max(maxLen,len);\n                }\n            }\n            else{\n                len=1;\n                count=1;\n            }\n        }\n\n        return maxLen;\n    }\n}\n```
['Java']