Easy to understand C++ Solution
Complexity\n- Time complexity: O(1)\n\n- Space complexity: O(1)\n\n# Code\ncpp []\nclass Solution {\npublic:\n    int smallestNumber(int n) {\n        for(int i
# Complexity\n- Time complexity: O(1)\n\n- Space complexity: O(1)\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int smallestNumber(int n) {\n        for(int i = 1; i <= 10; i++){\n            int x = pow(2, i) - 1;\n            if(x >= n) return x;\n        }\n        return -1;\n    }\n};\n```
['Bit Manipulation', 'C++']