{"push_id":1355464501,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"de320545f8dfc356fa5b42000e9c833d13835111","before":"4b168f60c76d2a08a72b8411e98b75f5f9e4e0ca","commits":[{"sha":"3133ef1306bb4f350ea2069e4ed69cf861da5512","author":{"name":"Devesh Bajpai","email":"c125a6a878d1ca85fbd7de2a8d0ec4dd7616b108@ca.com"},"message":"Iterative and Recursive DFS solutions","distinct":true,"url":"https://api.github.com/repos/deveshbajpai19/Leetcode/commits/3133ef1306bb4f350ea2069e4ed69cf861da5512"},{"sha":"de320545f8dfc356fa5b42000e9c833d13835111","author":{"name":"Devesh Bajpai","email":"c125a6a878d1ca85fbd7de2a8d0ec4dd7616b108@ca.com"},"message":"Merge branch 'master' of https://github.com/deveshbajpai19/Leetcode","distinct":true,"url":"https://api.github.com/repos/deveshbajpai19/Leetcode/commits/de320545f8dfc356fa5b42000e9c833d13835111"}]}
{"actor":{"display_login":"deveshbajpai19"}}