{"push_id":2894950562,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bf3990350bfa15e3073a625545047ad901292c0d","before":"40bc5df7ac75b667d0f48a17597f65c56134145b","commits":[{"sha":"bf3990350bfa15e3073a625545047ad901292c0d","author":{"name":"Veeresh Kamble","email":"ff52239c657e609e199b3d4f7112e8b1024f9242@gmail.com"},"message":"Coding Practice - Leetcode - Medium Collection - Trees and Graphs - Populating next right pointer in each node","distinct":true,"url":"https://api.github.com/repos/veereshkamble/Software-Engineer-Interview-Preparation/commits/bf3990350bfa15e3073a625545047ad901292c0d"}]}
{"actor":{"display_login":"veereshkamble"}}