Easy Solution, Faster than 100%, Observation Based
\nclass Solution {\npublic:\n    int bitwiseComplement(int n) {\n        if(n==0)\n            return 1;\n        int i=1;\n        while(i<=32){\n            i
```\nclass Solution {\npublic:\n    int bitwiseComplement(int n) {\n        if(n==0)\n            return 1;\n        int i=1;\n        while(i<=32){\n            if(n-pow(2,i)<0)\n                break;\n            i++;\n        }\n        return pow(2,i)-n-1;\n    }\n};\n```
['Bit Manipulation']