This video explains a very interesting programming question which is frequently asked in programming interviews and coding rounds. The problem is given an infinite grid, we want to find the minimum number to steps to cover a given sequence of points in the order of the sequence itself. Code link is mentioned below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: https://drive.google.com/open?id=1ZZPpVRFG1uEB_yq1cUdmY-mQq2feA9rV
