{"push_id":757935888,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"928d2cda86b003e407012615b34af3dc7fb13758","before":"3922af9a2d931f08f39ef533dfbbefd4dd6580f6","commits":[{"sha":"928d2cda86b003e407012615b34af3dc7fb13758","author":{"email":"0d0beafa570cd6a4d352ef38e31087ffaba7b292@gmail.com","name":"Summon Yang"},"message":"Given two strings s and t, write a function to determine if t is an anagram of\ns.\n\nFor example,\ns = \"anagram\", t = \"nagaram\", return true.\ns = \"rat\", t = \"car\", return false.\n\nNote:\nYou may assume the string contains only lowercase alphabets.","distinct":true,"url":"https://api.github.com/repos/SummonY/LeetCode/commits/928d2cda86b003e407012615b34af3dc7fb13758"}]}