String Subarrays Problem Statement Aarav, an aspiring linguist and programming enthusiast, enjoys finding patterns in words and letters. One day, while reading about the importance of vowels in the English language, he stumbles upon an interesting problem that blends his love for both linguistics and coding. He is given an array of size N, where each element is a single English alphabet. As he examines the array, he wonders if he can identify meaningful sequences within it. He comes up with an interesting challenge: A continuous subarray is considered good if it consists of only vowels (A, E, I, O, U). His task is to count the number of good subarrays in the given sequence. At first, Aarav begins by manually identifying such subarrays in small test cases. He picks out sequences of vowels and counts them one by one. However, as the array size increases, he quickly realizes that a brute-force approach—checking every possible subarray—is inefficient and impractical. Determined to crack the problem optimally, Aarav starts exploring different strategies. He recalls how subarray problems can often be solved efficiently using sliding window techniques, prefix sums, or mathematical observations. He wonders if there's a way to leverage these methods to quickly count the valid subarrays.