Python 3   ||   2 lines,  w/ example   ||   T/S: 87% / 99%
Here\'s the code:\n\nclass Solution:\n    def evenOddBit(self, n: int) -> List[int]:                 \n        evens, odds = int(\'0101010101\',2), int(\'101010
Here\'s the code:\n```\nclass Solution:\n    def evenOddBit(self, n: int) -> List[int]:                 \n        evens, odds = int(\'0101010101\',2), int(\'1010101010\',2)\n\n        return [(evens&n).bit_count(),(odds&n).bit_count()]\n```\nHere\'s an example:\n```\n   Example:  n = 545 --> \'0b1000100001\'\n\n       n = 1000100001       n = 1000100001\n   evens = 0101010101    odds = 1010101010\n           \u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013           \u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013\u2013\n evens&n = 0000000001  odds&n = 1000100000\n\n                 return [1,2]\n```\n[https://leetcode.com/problems/number-of-even-and-odd-bits/submissions/918209401/](https://leetcode.com/problems/number-of-even-and-odd-bits/submissions/918209401/)\n\nI could be wrong, but I think that time complexity is *O*(1) and space complexity is *O*(1).
['Python3']