C++| O(1) Time & Space Complexity 🔥| 2 Lines Of Logic 🔥| Faster Than 100% 🔥
\n\n    int smallestEvenMultiple(int n) {\n        \n        for(int i=1;i<=150;i++)\n        {\n            int mul = n*i;\n            if(mul % 2 == 0 && mul 
![image](https://assets.leetcode.com/users/images/756ea796-2dd8-490f-a795-a9c6a839816a_1667158364.1446862.png)\n\n    int smallestEvenMultiple(int n) {\n        \n        for(int i=1;i<=150;i++)\n        {\n            int mul = n*i;\n            if(mul % 2 == 0 && mul % i == 0)return mul;\n        }\n        return -1;\n    }\n\t\n\n\tWhy time complexity is O(1) ?\n\tBecz we are iterating till 150 in best, avg and even in worst case.\n\tBut if n is dynamic then this algorithm takes O(n)\n\t\n\t
['C']