{"action":"opened","issue":{"url":"https://api.github.com/repos/ryjen/challenges/issues/21","repository_url":"https://api.github.com/repos/ryjen/challenges","labels_url":"https://api.github.com/repos/ryjen/challenges/issues/21/labels{/name}","comments_url":"https://api.github.com/repos/ryjen/challenges/issues/21/comments","events_url":"https://api.github.com/repos/ryjen/challenges/issues/21/events","html_url":"https://github.com/ryjen/challenges/issues/21","id":319617806,"number":21,"title":"Daily Coding Problem: Problem #100","user":{"login":"ryjen","id":1249111,"avatar_url":"https://avatars0.githubusercontent.com/u/1249111?v=4","gravatar_id":"","url":"https://api.github.com/users/ryjen","html_url":"https://github.com/ryjen","followers_url":"https://api.github.com/users/ryjen/followers","following_url":"https://api.github.com/users/ryjen/following{/other_user}","gists_url":"https://api.github.com/users/ryjen/gists{/gist_id}","starred_url":"https://api.github.com/users/ryjen/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ryjen/subscriptions","organizations_url":"https://api.github.com/users/ryjen/orgs","repos_url":"https://api.github.com/users/ryjen/repos","events_url":"https://api.github.com/users/ryjen/events{/privacy}","received_events_url":"https://api.github.com/users/ryjen/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-05-02T16:10:16Z","updated_at":"2018-05-02T16:10:16Z","closed_at":null,"author_association":"OWNER","body":"Daily Coding Problem: Problem #100 Good morning. Here's your coding interview problem for today. This problem was asked by Google. You are in an infinite 2D grid where you can move in any of the 8 directions: (x,y) to (x+1, y), (x - 1, y), (x, y+1), (x, y-1), (x-1, y-1), (x+1,y+1), (x-1,y+1), (x+1,y-1) You are given a sequence of points and the order in which you need to cover the points. Give the minimum number of steps in which you can achieve it. You start from the first point. Example: Input: [(0, 0), (1, 1), (1, 2)] Output: 2 It takes 1 step to move from (0, 0) to (1, 1). It takes one more step to move from (1, 1) to (1, 2). Upgrade to premium and get in-depth solutions to every problem. If you liked this problem, feel free to forward it along! As always, shoot us an email if there's anything we can help with! No more? Unsubscribe. https://ift.tt/19fNRe4"}}
{"actor":{"display_login":"ryjen"}}