Problem Statemnt:Given an integer array of size 9 and replace the first occurrence of maximum value by 0?Note: Generate the following arrayarray([11, 2, 13, 4, 15, 6, 27, 8, 19])Print the Numpy array.Output Format :firstElementsecondElement

You are given an array of positive integers nums.Return the number of subarrays of nums, where the first and the last elements of the subarray are equal to the largest element in the subarray. Example 1:Input: nums = [1,4,3,3,2]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [1,4,3,3,2], with its largest element 1. The first element is 1 and the last element is also 1.subarray [1,4,3,3,2], with its largest element 4. The first element is 4 and the last element is also 4.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.subarray [1,4,3,3,2], with its largest element 2. The first element is 2 and the last element is also 2.subarray [1,4,3,3,2], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 2:Input: nums = [3,3,3]Output: 6Explanation:There are 6 subarrays which have the first and the last elements equal to the largest element of the subarray:subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.subarray [3,3,3], with its largest element 3. The first element is 3 and the last element is also 3.Hence, we return 6.Example 3:Input: nums = [1]Output: 1Explanation:There is a single subarray of nums which is [1], with its largest element 1. The first element is 1 and the last element is also 1.Hence, we return 1. Constraints:1 <= nums.length <= 1051 <= nums[i] <= 109

Given a 1D array, negate all elements which are between 3 and 8 (both inclusive)?Note: Generate the following arrayarray([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])Print the Numpy array.

Find the maximum element from the given array of integers.

What will be the output of the following code?arr=[1,4,8,10,18,6,9]print(max(arr), len(arr), min(arr), arr.remove(4), arr.pop())

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.