{"push_id":1355324616,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"92baf02fcbd2697ab0b8169573750bbff9415e9b","before":"308e563a2bf874b66d8a0d1bd8627584383772d4","commits":[{"sha":"92baf02fcbd2697ab0b8169573750bbff9415e9b","author":{"name":"suragys","email":"9a2f28b1314ed9ff91d0fa6891b16d10ef484606@gmail.com"},"message":"Create 70ClimbingStairs.java\n\n/*\r\nYou are climbing a stair case. It takes n steps to reach to the top.\r\n\r\nEach time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?\r\n*/","distinct":true,"url":"https://api.github.com/repos/suragys/Leet/commits/92baf02fcbd2697ab0b8169573750bbff9415e9b"}]}
{"actor":{"display_login":"suragys"}}