Given an array A, find the size of the smallest subarray asked in MountainBlue, 2022

-

Problem Statement :

 Given an array A, find the size of the smallest subarray such that it contains at least one occurrence of the maximum value of the array and at least one occurrence of the minimum value of the array. Problem Constraints 1<= |A| <= 2000 Input Format The first line is the number of elements in an array. The second line is the space-separated array elements. f.e: 123 4 means A= [1, 2, 3, 4] Output Format Return the lengtlh of the smallest subarray which has at léasi pne occurrence of minimum and maximum eleknenbot the array Example Input Input 1: LAG27A...........


Comments

Post a Comment

Popular posts from this blog

EV Minimize Array Cost asked in Infosys- march 2022 (available in c++ only)

-
                                                             EV_Minimize Array Cost connect with me on Facebook Twitter Instagram Github Youtube len(arr)-1 Σ(arri-arri-1)² i=1 len(arr) is the size of the array. Insert any integer at any location of the array such that the cost of the array is minimized. Find the minimum possible cost of the array after inserting exactly one element. Example a= [1, 3, 5, 2, 10] The cost of the array before insertion =(1-37+(3-57+(5-2)²+(2-102²= 81. Two of many scenarios are shown below. 1. Insert 4 between 3 and 5, cost of array = (1-37+(3-47+(4-57+(5-2)²+(2 107²2² = 79. 2. Insert 6 between 2 and 10, cost of array =(1-37+(3-5)+(5-27²+(2-67² + (6 107² = 49. It can be proven that 49 is the minimum cost possible. Return 49. Function Description Complete the function getMinimumCost in the editor below. mumest fas the following parameter arrfet an array of ietsge
Read more

Harry and Porter asked in MountainBlue ,2022

-
                                                          Problem Statement   Harry and Potter choose a word string. Harry chose a number M  (less than the length of the string) and Potter chose N (less than the length of the string).  Harry will cut M letters from the end of the string, add them to the beginning and will give it to Potter. Then, Potter will also cut N letters from the end of the string,  add it to the beginning and give it to Harry. This process will continue till they get the original word string back.  For a given string and given values of M and N, find the number of turns in which they will get the original word string back . Example If the string is AbcDef, M= 1 and N = 2 the Output must be 4 4604  Explanation This is how the words tend will change. Abcbef > fAbcDe Dejbes- cDefAb AbcDef As there are 4 steps needed to bring the.....................
Read more

For e-learning, various tutorials are provided to the students.

-
Image
 For e-learning, various tutorials are provided to the students. One of the tutorials shows the highlighter on a number A on the number line. There is a "jump" button in the tutorial. On pressing the "jump" button, the highlighter moves by a fixed number D towards the right side if D is positive and towards the left side if D is negative. The student has to press the button N number of times. The tutorial has various sets of exercises. For every exercise, the positions of the highlighter before every "jump" button press will be stored in the database. Write an algorithm to find the position of the highlighter before.....
Read more