{"push_id":716242369,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"898f6257895fa768e210ab13b198bcf6e9f7db93","before":"609d55bc43fa68b860875ea20502f6c130eddba9","commits":[{"sha":"ec5b50ef14193125af439cce7e0998b301acd15f","author":{"email":"9a28d35d71b7d65d20494fffa2e501ccbc140685@gmail.com","name":"Seven Li"},"message":"[complete] partition to 2 subsets of same sum","distinct":true,"url":"https://api.github.com/repos/7seven7lst/crackingTheCodeInterview/commits/ec5b50ef14193125af439cce7e0998b301acd15f"},{"sha":"898f6257895fa768e210ab13b198bcf6e9f7db93","author":{"email":"9a28d35d71b7d65d20494fffa2e501ccbc140685@gmail.com","name":"Seven Li"},"message":"[complete] longest Bitonic Subsequence","distinct":true,"url":"https://api.github.com/repos/7seven7lst/crackingTheCodeInterview/commits/898f6257895fa768e210ab13b198bcf6e9f7db93"}]}