# Smallest Even Multiple: Practice Notes
Smallest Even Multiple shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Return the smallest positive integer that is a multiple of both 2 and n: n if n is even, else 2n. Equivalently lcm(2,n) = 2n / gcd(2,n).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(1).
## Common mistake
Always returning 2n, which is twice too big when n is already even.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview helper that uses your resume.