2413. Smallest Even Multiple

🚀 **LeetCode 2413 – Smallest Even Multiple | Easy Explained** In this video, we break down one of the easiest and most important beginner problems from LeetCode and understand the logic behind finding the **smallest even multiple** of a number. --- 💡 **Approach:** * We need the smallest number divisible by both **2** and **n** * Key observation: * If **n is even** → it is already divisible by 2 → return **n** * If **n is odd** → multiply by 2 → return **2 × n** * This works because we are basically finding the **LCM of 2 and n** ([Leetcode][1]) 🧠 **Time Complexity:** O(1) ⚡ **Space Complexity:** O(1) --- 🔗 **GitHub Code:** 👉 https://github.com/Parmarprashant/LeetCode-Solutions/tree/main/2491-SmallestEvenMultiple 👨‍💻 **LeetCode Profile:** 👉 https://leetcode.com/u/parmarprashant/ 💼 **LinkedIn:** 👉 https://www.linkedin.com/in/prashant-parmar-dev/ --- 📌 **Notes:** * This is a direct application of **LCM (Least Common Multiple)** * Helps build strong basics in **number theory** * Very common beginner interview concept * Always look for patterns before overthinking 👀 --- 👍 If this helped you, don’t forget to Like, Share, and Subscribe! #LeetCode #DSA #CodingInterview #Programming #BeginnerFriendly #CPP [1]: https://leetcode.ca/2022-07-09-2413-Smallest-Even-Multiple/?utm_source=chatgpt.com "2413 - Smallest Even Multiple | Leetcode"