Previous Question The task is to find the minimum sum of Products of two arrays of the same size, given that k modifications are allowed on the first array. In each modification, one array element of the first array can either be increased or decreased by 2. Note: The product sum is Summation (A[i]*B[i]) for […]
Advanced Arrays | Minimum Sum of Products | Codewindow.in Read More »
Previous Question The city of Looneywalks has a rectangular grid of roads. One of the favorite pastimes of the folks at Looneywalks is to wander around the blocks. While they could take the shortest path, more often, they retrace their steps and engage themselves in finding the number of ways of reaching the destination with
Advanced Arrays | City of Looneywalks | Codewindow.in Read More »
Previous Question N monkeys are invited to a party where they start dancing. They dance in a circular formation, very similar to a Gujarati Garba or a Drum Circle. The dance requires the monkeys to constantly change positions after every 1 second. The change of position is not random & you, in the audience, observe
Advanced Arrays | Dancing Monkeys | Codewindow.in Read More »
Previous Question You have been given ‘N’ number of spherical Balloons of different radius when filled. You have to fill one balloon per day and the last balloon will be filled on Nth day. There is some rate of air reduction ‘K’ per day from each balloon. Fill the balloons in such an order so
Advanced Arrays | Spherical Balloons | Codewindow.in Read More »
Previous Question A man is doing an experiment with the device that he built newly. The structure of the device is as below diagram. B to E is a sloping surface with n holes, labelled H1, H2, … Hn, on it. Holes are of different diameters and depths. The man is releasing m number of
