Sum Of Infinite Array
The value of the sum can be very large, return the answer as modulus 10^9+7.
The first line of input contains a single integer T, representing the number of test cases or queries to be run. Then the T test cases follow. The first line of each test case contains a single integer N, denoting the size of the array “A”. The second line of each test case contains N single space-separated integers, elements of the array “A”. The third line of each test case contains a single integer Q, denoting the number of queries. Then each of the Q lines of each test case contains two single space-separated integers L, and R denoting the left and the right index of the infinite array “B” whose sum is to be returned.
For each test case, print Q space-separated integers that denote the answers of the given Q queries. Print the answer to each test case in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 100 1 <= N <= 10^4 1 <= A[i] <= 10^9 1 <= Q <= 10^4 1 <= L <= R <= 10^18 Time Limit: 1sec
Longest Subarray With Zero Sum
Merge Two Sorted Arrays Without Extra Space
Ninja And The Strictly Increasing Array
Negative To The End