Leetcode 2063. Vowels of All Substrings

Given a string, return the total number of vowel occurrences across all its substrings. Use a combinatorial approach: each vowel at index i contributes (i+1)*(n-i) to the sum, allowing an O(n) solution with 64-bit arithmetic for n up to 1e5.