{"push_id":2937377599,"size":4,"distinct_size":4,"ref":"refs/heads/master","head":"f0d21dcdd3f6a0aaa999cb0a991b269c9a91ab44","before":"14fc6c830441313dfbec680885477ccec077c8bb","commits":[{"sha":"6dfcb965fca49eb6ed3e9432d38b063375a88b06","author":{"name":"Mkishore7","email":"1b55e17db25e695f5d368526f8761e46acb13a49@gmail.com"},"message":"Edit-Distance.c\n\nGiven two strings str1 and str2 and below operations that can be performed on str1. Find the minimum number of edits (operations) required to convert ‘str1’ into ‘str2’.\r\nTest case :\r\nInput:\r\nsunday\r\nsaturday \r\nOutput:  3\r\nLast three and first characters are same.  We basically\r\nneed to convert \"un\" to \"atur\".  This can be done using\r\nbelow three operations. \r\nReplace 'n' with 'r', insert t, insert a","distinct":true,"url":"https://api.github.com/repos/codeShaurya/CodeToLearn-2/commits/6dfcb965fca49eb6ed3e9432d38b063375a88b06"},{"sha":"eb7c641bf8e3bc8b8f39caac3ad68a2a38ffca8e","author":{"name":"Mkishore7","email":"1b55e17db25e695f5d368526f8761e46acb13a49@gmail.com"},"message":"Update Edit-Distance.c","distinct":true,"url":"https://api.github.com/repos/codeShaurya/CodeToLearn-2/commits/eb7c641bf8e3bc8b8f39caac3ad68a2a38ffca8e"},{"sha":"dcc9e9997e116233b57f24c01ec0bd2dfbe51986","author":{"name":"Shubham Maurya","email":"1739f9b9a3d26822f07b6878e2bf6d7fdd445a22@gmail.com"},"message":"updated edist.c","distinct":true,"url":"https://api.github.com/repos/codeShaurya/CodeToLearn-2/commits/dcc9e9997e116233b57f24c01ec0bd2dfbe51986"},{"sha":"f0d21dcdd3f6a0aaa999cb0a991b269c9a91ab44","author":{"name":"Shubham Maurya","email":"1739f9b9a3d26822f07b6878e2bf6d7fdd445a22@gmail.com"},"message":"Merge pull request #10 from Mkishore7/patch-1\n\nedist problem","distinct":true,"url":"https://api.github.com/repos/codeShaurya/CodeToLearn-2/commits/f0d21dcdd3f6a0aaa999cb0a991b269c9a91ab44"}]}
{"actor":{"display_login":"codeShaurya"}}