{"push_id":951764137,"size":29,"distinct_size":29,"ref":"refs/heads/master","head":"0f5e3735492ced5f0c4445fd3367a222ddb3f8a3","before":"c5402884875fd317e4dca1081ae09881e2b5795c","commits":[{"sha":"d0b8a6263d475853759f85f5ee45c68b2f128cfd","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"traverse twice to avoid division","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/d0b8a6263d475853759f85f5ee45c68b2f128cfd"},{"sha":"32592507e544b75ad90c69c7316825a65d898855","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"use bit manipulation on reverse_bits","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/32592507e544b75ad90c69c7316825a65d898855"},{"sha":"995c255d5d33bf01217f5da965fd73074eddf23e","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"one scan for two sum","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/995c255d5d33bf01217f5da965fd73074eddf23e"},{"sha":"1b16e0445bfa6eb0a75c51eec402f6861eac1e62","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"add two linked list numbers","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/1b16e0445bfa6eb0a75c51eec402f6861eac1e62"},{"sha":"7e8c470c59a7823d068df5e5028483c84a491a70","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"use Manacher's algorithm to get longest palindrome","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/7e8c470c59a7823d068df5e5028483c84a491a70"},{"sha":"2d04e7edb42f71c98801afd9e361c277bc8873a1","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"get max sum of sub array","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/2d04e7edb42f71c98801afd9e361c277bc8873a1"},{"sha":"1b1cad165d9314cdd4f7281ea6a5a725c855418f","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"add 319 bulb switcher. math","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/1b1cad165d9314cdd4f7281ea6a5a725c855418f"},{"sha":"f59dbd68e7b30ab029906d4b2b721db8210b72bb","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"palindrome number. p/div % 10","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/f59dbd68e7b30ab029906d4b2b721db8210b72bb"},{"sha":"4d4949e834f946af8373c4a1e7615917cbbef162","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"scan from left, right. since right - left is the max when we start left, right from boundary","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/4d4949e834f946af8373c4a1e7615917cbbef162"},{"sha":"73997e0ae0ee60aff0e0a5ca18a59ab6c0e54cdd","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"group anagram. in python, only immutable var can be key in dict","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/73997e0ae0ee60aff0e0a5ca18a59ab6c0e54cdd"},{"sha":"fbc6b879ed8b38c6580ecff3479c871905d4aabf","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"use constant space","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/fbc6b879ed8b38c6580ecff3479c871905d4aabf"},{"sha":"79d805449a67b8cf94c965c2a6f8a3ac2441a37f","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"backtracking","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/79d805449a67b8cf94c965c2a6f8a3ac2441a37f"},{"sha":"b68fa0aab0439ced19ed20239037b6e5e5fd7ea3","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"balanced binary tree","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/b68fa0aab0439ced19ed20239037b6e5e5fd7ea3"},{"sha":"d8b537cdb5ae62715a7d5087a2f481a65a4ca0c5","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"two var: min_price, max_profit, one time scan","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/d8b537cdb5ae62715a7d5087a2f481a65a4ca0c5"},{"sha":"7d2b4fd57976b4b3208b07d3e932a2e32288ecc0","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"only use a max_profit var to record the max profit we can gain","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/7d2b4fd57976b4b3208b07d3e932a2e32288ecc0"},{"sha":"5906621b6da43232c2f11bea35b2544fb0bb253c","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"two round scan, use two array to store the value, then add together to get the max profit","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/5906621b6da43232c2f11bea35b2544fb0bb253c"},{"sha":"1f9bd234f5b2e645213a2b5eb1fff470749abcab","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"sell stock 4. dp: global and local, iteratively update these two array","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/1f9bd234f5b2e645213a2b5eb1fff470749abcab"},{"sha":"054d914f25c393cbbaf022d385d48150d77a8461","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"use a stack to store left node element. before pop a element, check whether its right is None, if not, then put it and its left child into stack","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/054d914f25c393cbbaf022d385d48150d77a8461"},{"sha":"09ed54b7c58d5c2dd4607e8cbfa142d9ea10234e","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"in order traversal , use stack","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/09ed54b7c58d5c2dd4607e8cbfa142d9ea10234e"},{"sha":"3ea57f12fc63c31b63377293ce28b5a1f5ab05d5","author":{"email":"8ac678cdb59b86391a0b2115efb7fd0cb7a4e16a@gmail.com","name":"adiggo"},"message":"use two stacks to implement queue","distinct":true,"url":"https://api.github.com/repos/adiggo/leetcode_py/commits/3ea57f12fc63c31b63377293ce28b5a1f5ab05d5"}]}