I gave coderpad round for goldman sachs on october\'20, 2 questions were asked \nTime duration : 1hr\n\n**Q1. Min length of subarray exceeding the target sum**\nexample:\n**[1,2,3,4], target = 6,**\nthen answer = **2** since sum of all elements of subarray [3,4]  has sum>=6 and its length is minimum\nand if **[1,2,3,4], target = 12,** then return **-1 **, since no subarray has sum>=12\n\nSolution:\nIntially I gave **O(n^2)**  approach , then explained **2 pointer approach**\nHowever faced some issue while coding it in coderpad.\n\n**Q2.optimal path to collect all rocks**\nGiven a 2D array, with arr[i][j] representing the number of rock at that location.\nFind optimal path from location A to location B in a multi dimensional array such that a person can collect maximum amount of rocks\n\nSolution:\n**I used recursive approach using a list to keep track of the visited nodes.**\n\nSince I got stuck in 1st problem for 40 min, had only 20 mins to code 2nd solution, didn\'t complete this problem also.\n\nI don\'t know whether they give some points for the approach , or they want the exact results to be returned.\n\nAnyways good experience, and I would advise all other people to manage their time efficiently here.\n

I gave coderpad round for goldman sachs on october\'20, 2 questions were asked \nTime duration : 1hr\n\nQ1. Min length of subarray exceeding the target sum\nexa