{"push_id":1247678293,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"76eb8dc09244b01a4adf360dbfe75cced63f14da","before":"324152af1f8bf1aad49dddbf0cbe8a71d94568b9","commits":[{"sha":"76eb8dc09244b01a4adf360dbfe75cced63f14da","author":{"name":"raunaak","email":"7de966d62797c53d0c383d3ad7868d8ed0f9332e@gmail.com"},"message":"Add function to detect number of ways to reach (m,n) from (0,0) in max k turns\n\nQuestion Link : http://www.geeksforgeeks.org/count-number-of-paths-with-k-turns/\r\nNote: My method is slightly different","distinct":true,"url":"https://api.github.com/repos/raunaak/Dynamic-Programming/commits/76eb8dc09244b01a4adf360dbfe75cced63f14da"}]}
{"actor":{"display_login":"raunaak"}}