Leetcode 1780. Check if Number is a Sum of Powers of Three #Leetcode #1780 #powers of three

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. Link of problem: https://leetcode.com/contest/biweekly-contest-47/problems/check-if-number-is-a-sum-of-powers-of-three/