Add solution #2413

Author: JoshCrozier

README.md

@@ -310,6 +310,7 @@
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|
+2413|[Smallest Even Multiple](./2413-smallest-even-multiple.js)|Easy|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|
 2469|[Convert the Temperature](./2469-convert-the-temperature.js)|Easy|
 2482|[Difference Between Ones and Zeros in Row and Column](./2482-difference-between-ones-and-zeros-in-row-and-column.js)|Medium|

solutions/2413-smallest-even-multiple.js

@@ -0,0 +1,15 @@
+/**
+ * 2413. Smallest Even Multiple
+ * https://leetcode.com/problems/smallest-even-multiple/
+ * Difficulty: Easy
+ *
+ * Given a positive integer n, return the smallest positive integer that is a multiple of both 2 and n.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var smallestEvenMultiple = function(n) {
+  return n * (n % 2 + 1);
+};