{"push_id":1036610756,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"bf3dc0ba39e9f1651282090f6569e9251512183b","before":"73ae743b759eca3b80c1ae1e17751cd3b0a161ea","commits":[{"sha":"bf3dc0ba39e9f1651282090f6569e9251512183b","author":{"email":"86bc899467088b883e88426bd8a3371d74ded12d@gmail.com","name":"Su Yan"},"message":"finish permutation question with DFS approach","distinct":true,"url":"https://api.github.com/repos/suyan/lintcode/commits/bf3dc0ba39e9f1651282090f6569e9251512183b"}]}