add 1780

Author: Ashwagandha-coder

contest/src/main/java/com/github/contest/Execute.kt

@@ -1,7 +1,7 @@
 package com.github.contest
 
 
-import com.github.contest.array.pivotArrayAlternativeSolution
+import com.github.contest.math.checkPowersOfThree
 import java.util.TreeMap
 
 
@@ -11,7 +11,7 @@ import java.util.TreeMap
 
 fun main() {
 
-    pivotArrayAlternativeSolution(intArrayOf(9, 12, 5, 10, 14, 3, 10), 10)
+    checkPowersOfThree(12)
 }
 
 fun generateTesting() {

contest/src/main/java/com/github/contest/array/AlternativeSolutionArray.kt

@@ -151,7 +151,7 @@ fun pivotArrayAlternativeSolution(nums: IntArray, pivot: Int): IntArray {
         equalCount--
     }
 
-    //Reverse the greater part
+
     var start = lessIndex
     var end = n - 1
     while (start < end) {

contest/src/main/java/com/github/contest/math/MathLeetcode.kt

@@ -4,4 +4,19 @@ package com.github.contest.math
  * 1025. Divisor Game
  */
 
-fun divisorGame(n: Int): Boolean = n % 2 == 0
+fun divisorGame(n: Int): Boolean = n % 2 == 0
+
+/**
+ * 1780. Check if Number is a Sum of Powers of Three
+ */
+
+fun checkPowersOfThree(n: Int): Boolean {
+    var num = n
+    while (num > 0) {
+        if (num % 3 == 2) {
+            return false
+        }
+        num /= 3
+    }
+    return true
+}