{"repository":{"watchers":0,"owner":"cezarcp","has_wiki":true,"pushed_at":"2013-01-15T17:29:33-08:00","description":"Solution to a code challenge I received during a job interview. The problem consists in finding the difference between the minimum possible sum of the elements in the two partitions of an array.","stargazers":0,"forks":0,"fork":false,"size":160,"created_at":"2013-01-15T17:24:18-08:00","open_issues":0,"has_issues":true,"has_downloads":true,"private":false},"actor_attributes":{"name":"Cezar","type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/cezarcp/BalancedPartition/compare/4cb54490fc...79c1802d5a"}