Add solution #483

Author: JoshCrozier

README.md

@@ -388,6 +388,7 @@
 480|[Sliding Window Median](./0480-sliding-window-median.js)|Hard|
 481|[Magical String](./0481-magical-string.js)|Medium|
 482|[License Key Formatting](./0482-license-key-formatting.js)|Easy|
+483|[Smallest Good Base](./0483-smallest-good-base.js)|Hard|
 485|[Max Consecutive Ones](./0485-max-consecutive-ones.js)|Easy|
 486|[Predict the Winner](./0486-predict-the-winner.js)|Medium|
 491|[Non-decreasing Subsequences](./0491-non-decreasing-subsequences.js)|Medium|

solutions/0483-smallest-good-base.js

@@ -0,0 +1,24 @@
+/**
+ * 483. Smallest Good Base
+ * https://leetcode.com/problems/smallest-good-base/
+ * Difficulty: Hard
+ *
+ * Given an integer n represented as a string, return the smallest good base of n.
+ *
+ * We call k >= 2 a good base of n, if all digits of n base k are 1's.
+ */
+
+/**
+ * @param {string} n
+ * @return {string}
+ */
+var smallestGoodBase = function(n) {
+  const num = BigInt(n);
+  for (let m = Math.floor(Math.log2(Number(n))); m >= 1; m--) {
+    const k = BigInt(Math.floor(Number(n) ** (1 / m)));
+    if (k < 2n) continue;
+    const sum = (k ** BigInt(m + 1) - 1n) / (k - 1n);
+    if (sum === num) return k.toString();
+  }
+  return (num - 1n).toString();
+};