You are given a string A, and you have to find all the amazing substrings of A.Problem Constraints
An amazing Substring is one that starts with a vowel (a, e, i, o, u, A, E, I, O, U).
Note: Take the mod of the answer with 10003.
1 <= |S| <= 106Input Format
S can have special characters
Only argument given is string S.Output Format
Return a single integer X mod 10003, where X is the number of Amazing Substrings in the given string.Example Input
Amazing substrings of the given string are :
here the number of substrings is 6 and 6 % 10003 = 6.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.