{"action":"created","issue":{"url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/1","repository_url":"https://api.github.com/repos/xphoniex/Google-Foobar","labels_url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/1/comments","events_url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/1/events","html_url":"https://github.com/xphoniex/Google-Foobar/issues/1","id":231815092,"number":1,"title":"Prepare the bunnies escape error","user":{"login":"hanuor","id":11363676,"avatar_url":"https://avatars0.githubusercontent.com/u/11363676?v=3","gravatar_id":"","url":"https://api.github.com/users/hanuor","html_url":"https://github.com/hanuor","followers_url":"https://api.github.com/users/hanuor/followers","following_url":"https://api.github.com/users/hanuor/following{/other_user}","gists_url":"https://api.github.com/users/hanuor/gists{/gist_id}","starred_url":"https://api.github.com/users/hanuor/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/hanuor/subscriptions","organizations_url":"https://api.github.com/users/hanuor/orgs","repos_url":"https://api.github.com/users/hanuor/repos","events_url":"https://api.github.com/users/hanuor/events{/privacy}","received_events_url":"https://api.github.com/users/hanuor/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":25,"created_at":"2017-05-27T17:10:28Z","updated_at":"2017-07-02T11:30:17Z","closed_at":null,"body":"Hi,\r\nI tried to run your code for 'Prepare the bunnies escape' challenge and its throwing an error saying 'The execution took too long'. Can you help me with the solution?\r\nThanks,\r\nShantanu"},"comment":{"url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/comments/312486234","html_url":"https://github.com/xphoniex/Google-Foobar/issues/1#issuecomment-312486234","issue_url":"https://api.github.com/repos/xphoniex/Google-Foobar/issues/1","id":312486234,"user":{"login":"wli75","id":16626035,"avatar_url":"https://avatars3.githubusercontent.com/u/16626035?v=3","gravatar_id":"","url":"https://api.github.com/users/wli75","html_url":"https://github.com/wli75","followers_url":"https://api.github.com/users/wli75/followers","following_url":"https://api.github.com/users/wli75/following{/other_user}","gists_url":"https://api.github.com/users/wli75/gists{/gist_id}","starred_url":"https://api.github.com/users/wli75/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/wli75/subscriptions","organizations_url":"https://api.github.com/users/wli75/orgs","repos_url":"https://api.github.com/users/wli75/repos","events_url":"https://api.github.com/users/wli75/events{/privacy}","received_events_url":"https://api.github.com/users/wli75/received_events","type":"User","site_admin":false},"created_at":"2017-07-02T11:30:17Z","updated_at":"2017-07-02T11:30:17Z","body":"I'm glad it works!\r\n\r\nSo cost[i][j][0] stores the shortest path from (0,0) to (i,j) without removing a wall, and cost[i][j][1] stores the shortest path if a wall is removed.\r\nIf the cost of a cell has changed, we need to update the costs of the other cells along its path, particularly cells higher or to the left of the changed cell.\r\nSince a path has **_roughly_** O(mn) cells, the outer hasChanged loop will be called O(mn) times. So the whole algorithm is O( (mn)^2 ), but it's okay since m,n <= 20.\r\n\r\nIf you're interested, here's another challenge that uses a similar technique https://www.hackerrank.com/contests/booking-womenintech/challenges/manhattan-2"}}
{"actor":{"display_login":"wli75"}}