1. Given an Array , E.g. [2,5,6,3,9,5,10,56,25] and a number X. now find all the contigous subarrays with length X , if X=3, then all the subarrays are [2,5,6], [5,6,3], [6,3,9] etc. now in all these subarrays find the minimum element. and out of all those minimum elements, return the maximum one. 2. Given a URL, Query the URL and fetch the JSON result (paginated), find all the subsequent result from new pages. parse the json and do some manipulation on that data, find a specific dataset from that json.