Problem statementSend feedbackYou are given an array ‘A’ of length ‘N’. You say an index ‘i’ is beautiful if the sum of the first ‘i - 1’ elements of the array ‘A’ equals the sum of the last ‘N - i’ elements of the array ‘A’, where ‘i’ is in 1-based indexing. Now you wonder which is the leftmost beautiful index.Note: If you select the first index, then the sum of the prefix will be ‘0’, and if you select the last index, then the sum of the suffix will be ‘0’.Note: You have to print the index in 1-based indexing.For example:Let’s say the array ‘A’ = [1, 3, 1, 5], then if we select index ‘2’, the sum of the prefix is ‘1’, and the sum of the suffix is 1 + 5 = 6. Since the sum is not the same, hence index ‘2’ is not a beautiful index.Detailed explanation ( Input/output format, Notes, Images )Constraints -1 <= ‘T’ <= 101 <= ‘N’ <= 10^5 -10^9 <= A[i] <= 10^9, for 1 <= i <= ‘N’Note- Sum of ‘N’ over all test cases does not exceed 10^5.Time Limit: 1 secSample Input-1231 1 131 2 3Sample Output-12-1Explanation for Sample Input 1:For test case 1: Index ‘2’ is the leftmost beautiful index. The left sum is 1 and the right sum is also 1.For test case 2: No index is beautiful.Sample Input -2261 7 3 6 5 632 1 -1Sample Output -241

Suppose you have an array 'A' consisting of N integers numbered from 1 to N.Let's define the M-beautiful number of the array as the minimum number that occurs in all of the subsegments of the array having length M . If there is no integer occuring in all subsegments of length M for some value of M, then the M-beautiful number is −1.For each k from 1 to n calculate the M-beautiful number of the array 'A'.Input FormatThe first line case contains one integer n — the number of elements in the array.The second line contains n integers a1,a2,…,an — the elements of the array.Constraints(1≤n≤3⋅10^5)(1≤ai≤n)Output FormatPrint n integers, where the i-th integer is equal to the i-beautiful number of the arraySample Input 051 1 3 2 4Sample Output 0-1 -1 3 1 1Sample Input 171 2 2 1 2 2 6Sample Output 1-1 2 2 1 1 1 1

What is the array index type? What is the lowest index? What is the representationof the third element in an array named a

First index of elementSend FeedbackTake an array with n elements with possibly duplicate elements as the input. The task is to find the index of the first occurrences of the element x in the array and, if it is not present, return -1.Input Format:The first line contains an integer N representing the size of the array.The next line contains N space-separated integers representing the elements of the array.The last line contains an integer 'x' whose index has to be found.Output Format:The only line of the output prints the Index or -1.Constraints:1 <= N <= 10^31 <= arr[i] <= 10^91 <= x < NSample Input 1 :87 5 2 11 2 43 1 12Sample Output 1 :2Explanation of Sample Input 1:2 is present twice in the input array and the first time it appears is at index 2.Sample Input 2 :87 5 2 11 2 43 1 110Sample Output 2 :-1Explanation of Sample Input 2:10 is not present in the array so the output is -1.

Problem StatementReport An IssueNinja has an array 'A' of length 'N'. He wanted to find the maximum element between index 'X' and 'Y', including both.Return the maximum element between 'X' and 'Y', including both.Consider 0-based indexing.Example:'N' = 5'X' = 1'Y' = 3'A' = [1, 2, 5, 2, 4]The maximum element in the range [1, 3] is 5.Hence, the answer for this case is 5.

You are given a 0-indexed array nums and an integer target.A 0-indexed array infinite_nums is generated by infinitely appending the elements of nums to itself.Return the length of the shortest subarray of the array infinite_nums with a sum equal to target. If there is no such subarray return -1.