Given an integer array nums, handle multiple queries of the following type:Calculate the sum of the elements of nums between indices left and right inclusive where left <= right.Implement the NumArray class:NumArray(int[] nums) Initializes the object with the integer array nums.int sumRange(int left, int right) Returns the sum of the elements of nums between indices left and right inclusive (i.e. nums[left] + nums[left + 1] + ... + nums[right]). Example 1:Input["NumArray", "sumRange", "sumRange", "sumRange"][[[-2, 0, 3, -5, 2, -1]], [0, 2], [2, 5], [0, 5]]Output[null, 1, -1, -3]ExplanationNumArray numArray = new NumArray([-2, 0, 3, -5, 2, -1]);numArray.sumRange(0, 2); // return (-2) + 0 + 3 = 1numArray.sumRange(2, 5); // return 3 + (-5) + 2 + (-1) = -1numArray.sumRange(0, 5); // return (-2) + 0 + 3 + (-5) + 2 + (-1) = -3 Constraints:1 <= nums.length <= 104-105 <= nums[i] <= 1050 <= left <= right < nums.lengthAt most 104 calls will be made to sumRange.

Given an array (1-based index) with the following elements:Array=[2,12,4,1,15,21,11,7,1,45,18,22,25]You have to perform two types of operations:Query in the form of Q(L, R): You will be given two integers L and R (1 <= L <= R <= 13). You have to find the summation of values within the index L to R inclusive using Segment Tree.For example Q(2,4) = 12+4+1 = 17Now answer the following questions: i) Tabulate the sparse table ii) Perform Query Q(3,10) iii) Perform Query Q(2,12)

You are given an integer array nums sorted in non-decreasing order.Build and return an integer array result with the same length as nums such that result[i] is equal to the summation of absolute differences between nums[i] and all the other elements in the array.In other words, result[i] is equal to sum(|nums[i]-nums[j]|) where 0 <= j < nums.length and j != i (0-indexed).

You are given an integer array nums, an integer array queries, and an integer x.For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.Return an integer array answer containing the answers to all queries. Example 1:Input: nums = [1,3,1,7], queries = [1,3,2,4], x = 1Output: [0,-1,2,-1]Explanation:For the 1st query, the first occurrence of 1 is at index 0.For the 2nd query, there are only two occurrences of 1 in nums, so the answer is -1.For the 3rd query, the second occurrence of 1 is at index 2.For the 4th query, there are only two occurrences of 1 in nums, so the answer is -1.Example 2:Input: nums = [1,2,3], queries = [10], x = 5Output: [-1]Explanation:For the 1st query, 5 doesn't exist in nums, so the answer is -1. Constraints:1 <= nums.length, queries.length <= 1051 <= queries[i] <= 1051 <= nums[i], x <= 104

1. Two SumEasy53.1K1.8KCompaniesGiven an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order. Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].Example 2:Input: nums = [3,2,4], target = 6Output: [1,2]Example 3:Input: nums = [3,3], target = 6Output: [0,1] Constraints:2 <= nums.length <= 104

Java program to sum values of an array.Write a Java program to sum values of an array. Constraints:N/AExample:Input:1, 2, 3, 4, 5, 6, 7, 8, 9, 10Output:55Explanation:-Public Test Cases:# INPUT EXPECTED OUTPUT1 1, 2, 3, 4, 5, 6, 7, 8, 9, 1055