{"push_id":1590583342,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"fd3518463424b2d1adc5c00bda8368935884b7c8","before":"fc9ebd47ca1acb500d320416d71a4d29c4f5d4e2","commits":[{"sha":"fd3518463424b2d1adc5c00bda8368935884b7c8","author":{"name":"Paxshal","email":"5a58da377921ae37b655946f64b00e452ddfd0a9@gmail.com"},"message":"Number Complement\n\nGiven a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.\r\n\r\nNote:\r\nThe given integer is guaranteed to fit within the range of a 32-bit signed integer.\r\nYou could assume no leading zero bit in the integer’s binary representation.\r\nExample 1:\r\nInput: 5\r\nOutput: 2\r\nExplanation: The binary representation of 5 is 101 (no leading zero bits), and its complement is 010. So you need to output 2.\r\nExample 2:\r\nInput: 1\r\nOutput: 0\r\nExplanation: The binary representation of 1 is 1 (no leading zero bits), and its complement is 0. So you need to output 0.","distinct":true,"url":"https://api.github.com/repos/mehtapaxshal/LeetCode/commits/fd3518463424b2d1adc5c00bda8368935884b7c8"}]}
{"actor":{"display_login":"mehtapaxshal"}}