✅[C++] | O(1) time | Innovative Solution✅
O(1) code\n\nclass Solution {\npublic:\n    int integerBreak(int n) {\n        if(n <= 3)\n            return n - 1;\n\n        int noOf3s = n/3, noOf2s = n%3;\
#### O(1) code\n```\nclass Solution {\npublic:\n    int integerBreak(int n) {\n        if(n <= 3)\n            return n - 1;\n\n        int noOf3s = n/3, noOf2s = n%3;\n        \n        if(noOf2s == 1) {\n            noOf3s--;\n            noOf2s = 2;\n        } else if(noOf2s == 2)\n            noOf2s = 1;\n\n        return pow(3, noOf3s) * pow(2, noOf2s);\n    }\n};\n```\n#### Complexity\n- Time complexity: $$O(1)$$ without considering pow operation\n\n- Space complexity: $$O(1)$$\n\nNOTE: \n- pow operation takes $$O(log(n))$$ time.\n
['Math', 'C++']