Smallest Even Multiple — LeetCode 2413 Python Solution

EasyMathNumber Theory
Problem
#2413
Reading time
2 min

The problem

Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n.

Example

Input
n = 5
Output
10
Explanation
The smallest multiple of both 5 and 2 is 10.

Python solution

Python
class Solution:
    def smallestEvenMultiple(self, n: int) -> int:
        return n if n % 2 == 0 else n * 2

Complexity

MeasureComplexity
TimeO(1)
SpaceO(1) auxiliary

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 2413. Smallest Even Multiple is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math and Number Theory.

The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.

Related problems

Frequently asked questions

How hard is LeetCode 2413. Smallest Even Multiple?
LeetCode 2413. Smallest Even Multiple is rated Easy on LeetCode.
What is the time complexity of LeetCode 2413. Smallest Even Multiple?
The Python solution on this page runs in O(1).
What is the space complexity of LeetCode 2413. Smallest Even Multiple?
The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2413. Smallest Even Multiple cover?
LeetCode 2413. Smallest Even Multiple is tagged Math and Number Theory on LeetCode.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity — invisible to screen sharing.

Get Stealth Interview