{"push_id":1706922202,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"437c915d77f56ce9e9b89984634c13502b4f0b0e","before":"6dfac76e51490387cb45a95a662bd1d5c769eb89","commits":[{"sha":"437c915d77f56ce9e9b89984634c13502b4f0b0e","author":{"name":"Saumitra Aditya","email":"4c743362ed0567c0bdcab1ddfd4e617a10089dff@users.noreply.github.com"},"message":"286. Walls and Gates\n\nBad solution: No need to do BFS so many times, start from the gates. Diff of (row,col) shortest distance does not takes into account walls.","distinct":true,"url":"https://api.github.com/repos/saumitraaditya/CodeChallenges/commits/437c915d77f56ce9e9b89984634c13502b4f0b0e"}]}
{"actor":{"display_login":"saumitraaditya"}}