Add solution #1780

Author: JoshCrozier

README.md

@@ -171,6 +171,7 @@
 1475|[Final Prices With a Special Discount in a Shop](./1475-final-prices-with-a-special-discount-in-a-shop.js)|Easy|
 1486|[XOR Operation in an Array](./1486-xor-operation-in-an-array.js)|Easy|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
+1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|
 2000|[Reverse Prefix of Word](./2000-reverse-prefix-of-word.js)|Easy|

solutions/1780-check-if-number-is-a-sum-of-powers-of-three.js

@@ -0,0 +1,24 @@
+/**
+ * 1780. Check if Number is a Sum of Powers of Three
+ * https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/
+ * Difficulty: Medium
+ *
+ * Given an integer n, return true if it is possible to represent n as the sum
+ * of distinct powers of three. Otherwise, return false.
+ *
+ * An integer y is a power of three if there exists an integer x such that y == 3x.
+ */
+
+/**
+ * @param {number} n
+ * @return {boolean}
+ */
+var checkPowersOfThree = function(n) {
+  while (n) {
+    if (n % 3 === 2) {
+      return 0;
+    }
+    n = n / 3 >> 0;
+  }
+  return 1;
+};