Go solution faster than 100% bit manuplation
\nfunc bitwiseComplement(N int) int {\n\tif N == 0 {\n\t\treturn 1\n\t}\n\tres := 0\n\tg := 1\n\tfor N > 0 {\n\t\tif N&1 == 0 {\n\t\t\tres += g\n\t\t}\n\t\tg <<
```\nfunc bitwiseComplement(N int) int {\n\tif N == 0 {\n\t\treturn 1\n\t}\n\tres := 0\n\tg := 1\n\tfor N > 0 {\n\t\tif N&1 == 0 {\n\t\t\tres += g\n\t\t}\n\t\tg <<= 1\n\t\tN >>= 1\n\t}\n\treturn res\n}\n```
['Bit Manipulation', 'Go']