Junior Software Engineer

Given an array “A” of N integers and you have also defined the new array “B” as a concatenation of array “A” for an infinite number of times.

For example, if the given array “A” is [1,2,3] then, infinite array “B” is [1,2,3,1,2,3,1,2,3,.......].

Now you are given Q queries, each query consists of two integers “L“ and “R”(1-based indexing). Your task is to find the sum of the subarray from index “L” to “R” (both inclusive) in the infinite array “B” for each query.

Note :

The value of the sum can be very large, return the answer as modulus 10^9+7.

• Write a query to find the 3rd highest salary from a table without top or limit keyword.
• Fetch employee names and salaries even if the salary value is not present for the employee.
• SQL query to fetch all the Employees from EmployeeDetails who joined in the Year 2020.

• Introduce yourself
• Why did you choose Zensar?
• What do you think makes you a better choice than others?