🔥EASY JAVA SOLUTION🔥|| READABLE SOLUTION___
Intuition\n Describe your first thoughts on how to solve this problem. \nThe vowels are \'a\',\'e\',\'i\',\'o\',\'u\' So they are in order then only the word be
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nThe vowels are `\'a\',\'e\',\'i\',\'o\',\'u\'` So they are in order then only the word become beautiful... which means every word have 5 vowels.\n\n---\n\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n1. Initialize a variable`count`which check for all the vowel present or not, a variable `l` for counting the length of the substring.\n2. Initialize another variable `max_len` with zero.\n3. Iterate through the words length starting from the index 1.\n    - Check if the character at `i` is equal to `i-1` if yes then increase the count of the `l` by 1.\n    - else if the character at `i-1` is less than `i` then increase the `count` and length `l` by 1.\n    - else set `count` and `l` to 1.\n    - if the `count` is equal to 5 then set the `max_len` to maximun of `l` and `max_len`.\n4. Return the value of the `max_len`.\n\n---\n\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$ - We traverse throught the length of the word only once\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(1)$$ - As no extra space is used to store character \n\n---\n\n\n# Code\n```\nclass Solution {\n    public int longestBeautifulSubstring(String word) {\n        int count = 1;\n        int l = 1;\n        int max_len = 0;\n\n        for (int i = 1; i < word.length(); i++) {\n            if (word.charAt(i) == word.charAt(i - 1)) {\n                l++;\n            } else if (word.charAt(i - 1) < word.charAt(i)) {\n                count++;\n                l++;\n            } else {\n                l = 1;\n                count = 1;\n            }\n            if (count == 5) {\n                max_len = Math.max(max_len, l);\n            }\n        }\n\n        return max_len;\n    }\n}\n```\n# *UPVOTE PLEASE...\uD83D\uDE0A* \n# For the easy explaination......\n![avatar.jpeg](https://assets.leetcode.com/users/images/c3390970-fddd-4f78-b53a-92fea7e72b5c_1721186715.05799.jpeg)\n
['Java']