EasyNo. 2413
Smallest Even Multiple — LeetCode 2413 Python Solution
- Pattern
- Math and Number Theory
- Topics
- Math, Number Theory
- Reading time
- 2 min
- Source
- leetcode.com
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
class Solution:
def smallestEvenMultiple(self, n: int) -> int:
return n if n % 2 == 0 else n * 2Complexity
- Time
- O(1)
- Space · auxiliary
- O(1)
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
| No. | Problem | Difficulty |
|---|---|---|
| 0204 | Count Primes | Medium |
| 0258 | Add Digits | Easy |
| 0858 | Mirror Reflection | Medium |
| 0866 | Prime Palindrome | Medium |
| 1250 | Check If It Is a Good Array | Hard |
| 1447 | Simplified Fractions | Medium |
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.