Java || Best Solution || O(1) Time complexity ✅
Complexity\n- Time complexity: O(1)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity: O(1)\n Add your space complexity here, e.g. O(n) \n\n# Co
# Complexity\n- Time complexity: O(1)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int smallestEvenMultiple(int n) {\n        if(n%2==0){\n            return n;\n        }\n        else\n        return 2*n;\n    }\n}\n```\n> Upvote Please\n
['Java']