LC 2665. Counter II (JS)

Author: raul-sauco

README.md

@@ -474,6 +474,7 @@ Solutions to LeetCode problems. The first column links to the problem in LeetCod
 | [2244. Minimum Rounds to Complete All Tasks][lc2244]                                          | 🟠 Medium  | [![python](res/py.png)][lc2244py]                                                                     |
 | [2246. Longest Path With Different Adjacent Characters][lc2246]                               | 🔴 Hard    | [![python](res/py.png)][lc2246py]                                                                     |
 | [2256. Minimum Average Difference][lc2256]                                                    | 🟠 Medium  | [![python](res/py.png)][lc2256py]                                                                     |
+| [2665. Counter II][lc2265]                                                                    | 🟢 Easy    | [![python](res/py.png)][lc2265py]                                                                     |
 | [2279. Maximum Bags With Full Capacity of Rocks][lc2279]                                      | 🟠 Medium  | [![python](res/py.png)][lc2279py]                                                                     |
 | [2300. Successful Pairs of Spells and Potions][lc2300]                                        | 🟠 Medium  | [![python](res/py.png)][lc2300py] [![rust](res/rs.png)][lc2300rs]                                     |
 | [2306. Naming a Company][lc2306]                                                              | 🔴 Hard    | [![python](res/py.png)][lc2306py] [![rust](res/rs.png)][lc2306rs]                                     |
@@ -1510,6 +1511,8 @@ Solutions to LeetCode problems. The first column links to the problem in LeetCod
 [lc2246py]: leetcode/longest-path-with-different-adjacent-characters.py
 [lc2256]: https://leetcode.com/problems/minimum-average-difference/
 [lc2256py]: leetcode/minimum-average-difference.py
+[lc2265]: https://leetcode.com/problems/counter-ii/
+[lc2265py]: leetcode/counter-ii.js
 [lc2279]: https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks/
 [lc2279py]: leetcode/maximum-bags-with-full-capacity-of-rocks.py
 [lc2300]: https://leetcode.com/problems/successful-pairs-of-spells-and-potions/

leetcode/counter-ii.js

@@ -0,0 +1,35 @@
+// 2665. Counter II
+// 🟢 Easy
+//
+// https://leetcode.com/problems/counter-ii/
+//
+// Tags: Javascript
+
+// Use the parameter as state inside the closure and add another variable
+// initialized with the same value, return an object with the three functions
+// that the problem asks for.
+//
+// Time complexity: O(1)
+// Space complexity: O(1)
+//
+// Runtime 69 ms Beats 46.34%
+// Memory 44.9 MB Beats 40.38%
+/**
+ * @param {integer} init
+ * @return { increment: Function, decrement: Function, reset: Function }
+ */
+var createCounter = function (init) {
+  let n = init;
+  return {
+    increment: () => ++n,
+    decrement: () => --n,
+    reset: () => (n = init),
+  };
+};
+
+/**
+ * const counter = createCounter(5)
+ * counter.increment(); // 6
+ * counter.reset(); // 5
+ * counter.decrement(); // 4
+ */