Given an unsorted array A of size N that contains only non-negative integers, find a continuous sub-array which adds to a given number S and return the left and right index(1-based indexing) of that subarray.
Given an unsorted array A of size N that contains only non-negative integers, find a continuous sub-array which adds to a given number S and return the left and right index(1-based indexing) of that subarray.
Given an array A of size N of integers. Your task is to find the minimum and maximum element in the array.
Given an array, rotate the array by one position in clock-wise direction. Below question to rotate an array is taken from GeeksforGeeks platform . To rotate an array following are steps : 1) Store last element in a variable say x.2) Shift all elements one position ahead.3) Replace first element of array with x. Example 1: Example… Read More
