Add solution #650

Author: JoshCrozier

README.md

@@ -489,6 +489,7 @@
 647|[Palindromic Substrings](./0647-palindromic-substrings.js)|Medium|
 648|[Replace Words](./0648-replace-words.js)|Medium|
 649|[Dota2 Senate](./0649-dota2-senate.js)|Medium|
+650|[2 Keys Keyboard](./0650-2-keys-keyboard.js)|Medium|
 653|[Two Sum IV - Input is a BST](./0653-two-sum-iv-input-is-a-bst.js)|Easy|
 654|[Maximum Binary Tree](./0654-maximum-binary-tree.js)|Medium|
 680|[Valid Palindrome II](./0680-valid-palindrome-ii.js)|Easy|

solutions/0650-2-keys-keyboard.js

@@ -0,0 +1,32 @@
+/**
+ * 650. 2 Keys Keyboard
+ * https://leetcode.com/problems/2-keys-keyboard/
+ * Difficulty: Medium
+ *
+ * There is only one character 'A' on the screen of a notepad. You can perform one of two
+ * operations on this notepad for each step:
+ * - Copy All: You can copy all the characters present on the screen (a partial copy is
+ *   not allowed).
+ * - Paste: You can paste the characters which are copied last time.
+ *
+ * Given an integer n, return the minimum number of operations to get the character 'A'
+ * exactly n times on the screen.
+ */
+
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var minSteps = function(n) {
+  let result = 0;
+
+  for (let factor = 2; n > 1;) {
+    while (n % factor === 0) {
+      result += factor;
+      n /= factor;
+    }
+    factor++;
+  }
+
+  return result;
+};