{"push_id":2453256888,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"10ba5a1c597d079f8b98866901e08f7588aa860a","before":"624cc539a35d62e600264e46268d9003efaa2dc1","commits":[{"sha":"10ba5a1c597d079f8b98866901e08f7588aa860a","author":{"name":"Aditya Gupta","email":"e57d73dff28cc5cd64ac178dbb8c422b3c1b83fc@gmail.com"},"message":"This is a program to find the largest number that is less than or equal to N with monotone increasing digits.\n\nRecall that an integer has monotone increasing digits if and only if each pair of adjacent digits x and y satisfy x <= y.","distinct":true,"url":"https://api.github.com/repos/contactaditya/Interview-Preparation/commits/10ba5a1c597d079f8b98866901e08f7588aa860a"}]}
{"actor":{"display_login":"contactaditya"}}