{"push_id":1424327703,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"54a551df1bba67841fbf657f7cdb98d2942c58d0","before":"57f737782b8b2db010b6d558a254246d7d5826e0","commits":[{"sha":"54a551df1bba67841fbf657f7cdb98d2942c58d0","author":{"name":"Lakshmikant Deshpande","email":"6932a471e6e2a025365966a02d3f3a7d7f20510c@gmail.com"},"message":"Merge Sorted Linked lists\n\n1. Use fast pointer for even/odd LL length\n2. Merged Sorted LL using recursion\n3. Merged Sorted LL without using recursion (while loop)\n4. Printed LL in reverse using recursion","distinct":true,"url":"https://api.github.com/repos/lakshmikantdeshpande/Algorithms_and_Data_Structures/commits/54a551df1bba67841fbf657f7cdb98d2942c58d0"}]}
{"actor":{"display_login":"lakshmikantdeshpande"}}