* Had one question on the lines of 2 sum but there could be multiple results possible and we have to return the result pair that had the bigger integer.\n* Second questions was given a list of forward routes and reverse routes and the maxTravelAllowed: return the most optimal pairs\n\t* example: maxTravelDist = 10000\n\t* forwardRouteList[] = [1,3000],[2,5000],[3,7000],[4,10000]\n\t* returnRouteList[] = [1,2000],[2,3000],[3,4000],[4,5000]\n\t* O/p: [[2,4],[3,2]]

Had one question on the lines of 2 sum but there could be multiple results possible and we have to return the result pair that had the bigger integer.\n Second 