{"push_id":566936644,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"90008e8a9b55bbc5b3fcfe53945e55dfc1671d1e","before":"0b53611f35faa3cc46256e3f77f2ef027e1c156a","commits":[{"sha":"90008e8a9b55bbc5b3fcfe53945e55dfc1671d1e","author":{"email":"1832b969e0ce443e7455fc27f1a13a0b1f02df78@cisco.com","name":"Sujith S"},"message":"longest increasing subsequece with patience sorting","distinct":true,"url":"https://api.github.com/repos/sujiths/Projects/commits/90008e8a9b55bbc5b3fcfe53945e55dfc1671d1e"}]}