{"push_id":1087335817,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"b311faf62f0fba5a824eaceb629fbd00edd5fc4b","before":"79b15ea56e4ff10cb3b58a0fbd523d2497c6d1b5","commits":[{"sha":"c7c650abd7d298b7ca7a0c9344982529318183f1","author":{"email":"f45c39082cf49fc8cc87ce431d9b1e4869fbac66@uark.edu","name":"Seok Lee"},"message":"inverting tree in python","distinct":true,"url":"https://api.github.com/repos/seoklee/leetcode/commits/c7c650abd7d298b7ca7a0c9344982529318183f1"},{"sha":"b311faf62f0fba5a824eaceb629fbd00edd5fc4b","author":{"email":"f45c39082cf49fc8cc87ce431d9b1e4869fbac66@uark.edu","name":"Seok Lee"},"message":"easy dp & logic problem","distinct":true,"url":"https://api.github.com/repos/seoklee/leetcode/commits/b311faf62f0fba5a824eaceb629fbd00edd5fc4b"}]}