{"push_id":1304299366,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2cbdf73c0fb82396390c96d56231583f4870a8b4","before":"84b6136428c063ee94dba82fb3f89bd2a53461f8","commits":[{"sha":"2cbdf73c0fb82396390c96d56231583f4870a8b4","author":{"name":"suranT0T","email":"92bc92bdafb44f2c60f407c80c691c6c8743d31a@outlook.com"},"message":"Longest Substring Without Repeating Characters\n\nGiven a string, find the length of the longest substring without\nrepeating characters.\n\nExamples:\n\nGiven \"abcabcbb\", the answer is \"abc\", which the length is 3.\n\nGiven \"bbbbb\", the answer is \"b\", with the length of 1.\n\nGiven \"pwwkew\", the answer is \"wke\", with the length of 3. Note that the\nanswer must be a substring, \"pwke\" is a subsequence and not a substring.","distinct":true,"url":"https://api.github.com/repos/suranT0T/leetcode/commits/2cbdf73c0fb82396390c96d56231583f4870a8b4"}]}
{"actor":{"display_login":"suranT0T"}}