Solving the 'Amazing Subarrays' Problem in Java
Problem:
Count substrings starting with a vowel in a given string, modulo 10003.
Solution:
public class Solution {
public int solve(String A) {
int count = 0;
char vowels[] = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'};
...
