Add solution #1404

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,283 LeetCode solutions in JavaScript
+# 1,284 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1072,6 +1072,7 @@
 1401|[Circle and Rectangle Overlapping](./solutions/1401-circle-and-rectangle-overlapping.js)|Medium|
 1402|[Reducing Dishes](./solutions/1402-reducing-dishes.js)|Hard|
 1403|[Minimum Subsequence in Non-Increasing Order](./solutions/1403-minimum-subsequence-in-non-increasing-order.js)|Easy|
+1404|[Number of Steps to Reduce a Number in Binary Representation to One](./solutions/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js)|Medium|
 1408|[String Matching in an Array](./solutions/1408-string-matching-in-an-array.js)|Easy|
 1410|[HTML Entity Parser](./solutions/1410-html-entity-parser.js)|Medium|
 1415|[The k-th Lexicographical String of All Happy Strings of Length n](./solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.js)|Medium|

solutions/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.js

@@ -0,0 +1,32 @@
+/**
+ * 1404. Number of Steps to Reduce a Number in Binary Representation to One
+ * https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/
+ * Difficulty: Medium
+ *
+ * Given the binary representation of an integer as a string s, return the number of steps to reduce
+ * it to 1 under the following rules:
+ * - If the current number is even, you have to divide it by 2.
+ * - If the current number is odd, you have to add 1 to it.
+ *
+ * It is guaranteed that you can always reach one for all test cases.
+ */
+
+/**
+ * @param {string} s
+ * @return {number}
+ */
+var numSteps = function(s) {
+  let num = BigInt(`0b${s}`);
+  let steps = 0;
+
+  while (num !== 1n) {
+    if (num % 2n === 0n) {
+      num /= 2n;
+    } else {
+      num += 1n;
+    }
+    steps++;
+  }
+
+  return steps;
+};