1st round is basic thing 2nd round is scenario-based. Given an array of positive integers A and an integer B, find and return first continuous subarray which adds to B. If the answer does not exist return an array with a single element "-1". First sub-array means the sub-array for which starting index is minimum. Problem Constraints 1 <= length of the array <= 100000 1 <= A[i] <= 10^9 1 <= B <= 10^9 Input Format The first argument given is the integer array A. The second argument given is integer B. Output Format Return the first continuous sub-array which adds to B and if the answer does not exist return an array with a single element "-1". Input A = [1, 2, 3, 4, 5] B = 5
