{"push_id":2750786282,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"00447889c96db5139ed04b2862d0b9904fcaabaf","before":"3404fb524da3a49ccae29b81f028a5d670f79b95","commits":[{"sha":"00447889c96db5139ed04b2862d0b9904fcaabaf","author":{"name":"Moksh Jawa","email":"ab5cb3a9e0db1f62c7bf10524b3e8cb0455c10f3@gmail.com"},"message":"LeetCode 654. Maximum Binary Tree","distinct":true,"url":"https://api.github.com/repos/mokshjawa/Java-Practice/commits/00447889c96db5139ed04b2862d0b9904fcaabaf"}]}
{"actor":{"display_login":"mokshjawa"}}