Company: visa_6oct
Difficulty: medium
Count Valid Messages Problem Description You are developing a feature for a new social media platform where you need to analyze user-generated content for reporting purposes. Given an array of strings messages , each representing a user message, your task is to count how many messages have an odd length and contain at least one vowel (letters 'a', 'e', 'i', 'o', 'u', both uppercase and lowercase). Note: You are not expected to provide the most optimal solution, but a solution with time complexity not worse than O( messages.length * max(message.length) ) will fit within the execution time limit. Examples Example 1: Input: messages = ["I", "love", "CSS", "She respects HTML"] Output: 2 Explanation: "I" has an odd length and contains a vowel. "love" has an even length. "CSS" has an odd length but contains no vowels. "She respects HTML" has an odd length (length of this string equals 17) and contains several vowels (three letters 'e'). Therefore, 2 messages meet the criteria. Constraints 1