Suppose Suzuka has an empty string S. In First iteration she adds all character from 'a' to 'z' in S i.e now S = "abcdefghijklmnopqrstuvwxyz".
In Second iteration she add all character from 'a' to 'z' two times each i.e after second iteration S = "a..zaabbccdd..zz"
Similarly in Third iteration she add all characters from 'a' to 'z' three times each, and so on suzuka perform the iterations infinite number of times.
Nobita asks out Suzuka for a Drive but Suzuka will only go with Nobita if Nobita solves a certain problem.
As you are a good friend of Nobita, he ask you to solve the problem.
You have to answer Q queries ,in each query you are given two integer L and R you need to tell the number of vowels in the substring of String S ranging from L to R inclusive.
1 <= L, R <= 109
1 <= Q <= 103
First and only argument is an 2D integer array A of size
Q x 2 where (A[i], A[i]) denotes the L, R for Query i.
Return an integer array containing
Q integers denoting the answers to queries.
A = [ [1, 5] [26, 29] ]
A = [ [79, 85] ]
String S = "abcdefghijklmnopqrstuvwxyzaabbccddeeff...zzaaabbbccc...zzz......" Query 1: Substring [1 : 5] of S is "abcde" Number of vowels = 2 Query 2: Substring [26 : 29] of S is "zaab" Number of vowels = 2
Query 1: Substring [79 : 85] of S is "aaabb" Number of vowels = 3
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.