{"repository":{"description":"Finds the Sum of MaxSubArray in 1D array","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"harry1357931","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-07-07T17:24:33-07:00","pushed_at":"2013-07-07T17:24:33-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Gurpreet Singh","blog":"http://gurpreetsinghny.com/","location":"New York","email":"fa9907ae057a158a564b0c2a5c581d96a13c4048@gmail.com"},"url":"https://github.com/harry1357931/Maximum_Subarray_Problem"}