Solutions

Author: trinhminhtriet

solutions/0300-0399/0326.power-of-three/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn is_power_of_three(mut n: i32) -> bool {
+        while n > 2 {
+            if n % 3 != 0 {
+                return false;
+            }
+            n /= 3;
+        }
+        n == 1
+    }
+}

solutions/0300-0399/0326.power-of-three/Solution2.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var isPowerOfThree = function (n) {
+    return n > 0 && 1162261467 % n == 0;
+};

solutions/0300-0399/0326.power-of-three/Solution2.rs

@@ -0,0 +1,5 @@
+impl Solution {
+    pub fn is_power_of_three(mut n: i32) -> bool {
+        n > 0 && 1162261467 % n == 0
+    }
+}

solutions/0300-0399/0326.power-of-three/Solution2.ts

@@ -0,0 +1,3 @@
+function isPowerOfThree(n: number): boolean {
+    return n > 0 && 1162261467 % n == 0;
+}

solutions/1500-1599/1502.can-make-arithmetic-progression-from-sequence/Solution2.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} arr
+ * @return {boolean}
+ */
+var canMakeArithmeticProgression = function (arr) {
+    const n = arr.length;
+    const a = Math.min(...arr);
+    const b = Math.max(...arr);
+
+    if ((b - a) % (n - 1) !== 0) {
+        return false;
+    }
+
+    const d = (b - a) / (n - 1);
+    const s = new Set(arr);
+
+    for (let i = 0; i < n; ++i) {
+        if (!s.has(a + d * i)) {
+            return false;
+        }
+    }
+    return true;
+};