chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2025-12-08-1925-Count-Square-Sum-Triples/explanation.md

@@ -0,0 +1,30 @@
+# Count Square Sum Triples (Easy)
+
+**Problem ID:** 1925  
+**Date:** 2025-12-08  
+**Link:** https://leetcode.com/problems/count-square-sum-triples/
+
+## Approach
+
+To solve the problem of counting square sum triples (a, b, c) such that \( a^2 + b^2 = c^2 \) with the constraints \( 1 \leq a, b, c \leq n \), we can follow a systematic approach:
+
+### Main Idea
+The core idea is to identify all valid triples (a, b, c) that satisfy the Pythagorean theorem within the given range. We can achieve this by iterating through possible values of c and checking for pairs (a, b) that fulfill the equation.
+
+### Steps
+1. **Iterate Over c**: Loop through all integers from 1 to n for the variable c.
+2. **Calculate c²**: For each c, compute \( c^2 \).
+3. **Find Pairs (a, b)**: For each possible integer a from 1 to c (since a and b can be at most c), calculate \( b^2 \) as \( c^2 - a^2 \).
+4. **Check Validity**: If \( b^2 \) is a perfect square, and \( b \) (which is the square root of \( b^2 \)) is also less than or equal to n, then we have found a valid pair (a, b).
+5. **Count Unique Triples**: Since the order of (a, b) matters, count both (a, b, c) and (b, a, c) if a ≠ b.
+
+### Data Structures
+- **Integer Variables**: To store the values of a, b, and c.
+- **Counter**: An integer to keep track of the number of valid triples found.
+
+### Complexity
+- **Time Complexity**: The outer loop runs n times (for c), and the inner loop runs at most c times (for a). Thus, the overall complexity is approximately \( O(n^2) \), which is efficient given the constraint \( n \leq 250 \).
+- **Space Complexity**: O(1) since we are only using a fixed number of variables for counting and calculations.
+
+### Conclusion
+This approach efficiently counts the valid square sum triples by leveraging the properties of Pythagorean triples and iterating through potential values systematically. The method ensures that we do not miss any combinations and adheres to the constraints provided.

Easy/2025-12-08-1925-Count-Square-Sum-Triples/solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int countTriples(int n) {
+        int count = 0;
+        for (int a = 1; a <= n; a++) {
+            for (int b = a; b <= n; b++) {
+                int c2 = a * a + b * b;
+                int c = (int) Math.sqrt(c2);
+                if (c * c == c2 && c <= n) {
+                    count += (a == b) ? 1 : 2; // (a, b, c) and (b, a, c) are different if a != b
+                }
+            }
+        }
+        return count;
+    }
+}

Easy/2025-12-08-1925-Count-Square-Sum-Triples/solution.js

@@ -0,0 +1,13 @@
+var countTriples = function(n) {
+    let count = 0;
+    for (let a = 1; a <= n; a++) {
+        for (let b = a; b <= n; b++) {
+            const c2 = a * a + b * b;
+            const c = Math.sqrt(c2);
+            if (c % 1 === 0 && c <= n) {
+                count += (a === b) ? 1 : 2; // (a, b, c) and (b, a, c) are distinct if a != b
+            }
+        }
+    }
+    return count;
+};

Easy/2025-12-08-1925-Count-Square-Sum-Triples/solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def countTriples(self, n: int) -> int:
+        count = 0
+        for a in range(1, n + 1):
+            for b in range(a, n + 1):
+                c_squared = a * a + b * b
+                c = int(c_squared**0.5)
+                if c * c == c_squared and c <= n:
+                    count += 1 if a == b else 2
+        return count

README.md

@@ -298,3 +298,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2025-12-05 — [Count Partitions with Even Sum Difference](https://leetcode.com/problems/count-partitions-with-even-sum-difference/) (Easy) → `Easy/2025-12-05-3432-Count-Partitions-with-Even-Sum-Difference`
 - 2025-12-06 — [Count Partitions With Max-Min Difference at Most K](https://leetcode.com/problems/count-partitions-with-max-min-difference-at-most-k/) (Medium) → `Medium/2025-12-06-3578-Count-Partitions-With-Max-Min-Difference-at-Most-K`
 - 2025-12-07 — [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) (Easy) → `Easy/2025-12-07-1523-Count-Odd-Numbers-in-an-Interval-Range`
+- 2025-12-08 — [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/) (Easy) → `Easy/2025-12-08-1925-Count-Square-Sum-Triples`