add daily exercise

Author: RuiAlves99k

lib/exercises/daily/2025/03/daily20250304.dart

@@ -0,0 +1,31 @@
+import 'dart:math';
+
+/// https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/description
+/// 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.
+///
+/// Example 1:
+///
+/// Input: n = 12
+/// Output: true
+/// Explanation: 12 = 31 + 32
+/// Example 2:
+///
+/// Input: n = 91
+/// Output: true
+/// Explanation: 91 = 30 + 32 + 34
+/// Example 3:
+///
+/// Input: n = 21
+/// Output: false
+class Daily20250304 {
+  bool checkPowersOfThree(int n) {
+    while (n > 1){
+      if (n % 3 == 2){
+        return false;
+      }
+      n = (n/3).round();
+    }
+    return true;
+  }
+}

test/leetcode_daily_test.dart

@@ -2,6 +2,7 @@ import 'package:leetcode/exercises/add_two_numbers.dart';
 import 'package:leetcode/exercises/daily/2025/03/daily20250301.dart';
 import 'package:leetcode/exercises/daily/2025/03/daily20250302.dart';
 import 'package:leetcode/exercises/daily/2025/03/daily20250303.dart';
+import 'package:leetcode/exercises/daily/2025/03/daily20250304.dart';
 import 'package:leetcode/models/list_node.dart';
 import 'package:test/test.dart';
 
@@ -27,4 +28,11 @@ void dailyExercises() {
     expect(daily.pivotArray([9,12,5,10,14,3,10], 10), [9,5,3,10,10,12,14]);
     expect(daily.pivotArray([-3,4,3,2], 2), [-3,2,4,3]);
   });
+  test('Daily 2025-03-04', (){
+    final daily = Daily20250304();
+    expect(daily.checkPowersOfThree(12) , true);
+    expect(daily.checkPowersOfThree(91), true);
+    expect(daily.checkPowersOfThree(21), false);
+  });
+
 }