{"action":"closed","issue":{"url":"https://api.github.com/repos/akhalikov/algo/issues/50","labels_url":"https://api.github.com/repos/akhalikov/algo/issues/50/labels{/name}","comments_url":"https://api.github.com/repos/akhalikov/algo/issues/50/comments","events_url":"https://api.github.com/repos/akhalikov/algo/issues/50/events","html_url":"https://github.com/akhalikov/algo/issues/50","id":89133896,"number":50,"title":"[algo] Largest continuous sum","user":{"login":"akhalikov","id":167376,"avatar_url":"https://avatars.githubusercontent.com/u/167376?v=3","gravatar_id":"","url":"https://api.github.com/users/akhalikov","html_url":"https://github.com/akhalikov","followers_url":"https://api.github.com/users/akhalikov/followers","following_url":"https://api.github.com/users/akhalikov/following{/other_user}","gists_url":"https://api.github.com/users/akhalikov/gists{/gist_id}","starred_url":"https://api.github.com/users/akhalikov/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/akhalikov/subscriptions","organizations_url":"https://api.github.com/users/akhalikov/orgs","repos_url":"https://api.github.com/users/akhalikov/repos","events_url":"https://api.github.com/users/akhalikov/events{/privacy}","received_events_url":"https://api.github.com/users/akhalikov/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2015-06-17T21:42:52Z","updated_at":"2015-12-28T21:57:39Z","closed_at":"2015-12-28T21:57:39Z","body":"This is one of the most common interview practice questions. Given an array of integers (positive and negative) find the largest continuous sum.\r\n\r\nhttp://www.ardendertat.com/2011/09/24/programming-interview-questions-3-largest-continuous-sum\r\n\r\n- tell about how you're gonna solve the problem\r\n- pseudocode\r\n- code\r\n- mind debugging\r\n- can I do faster ?"}}