chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three/explanation.md

@@ -0,0 +1,33 @@
+# Find Minimum Operations to Make All Elements Divisible by Three (Easy)
+
+**Problem ID:** 3190  
+**Date:** 2025-11-22  
+**Link:** https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/
+
+## Approach
+
+To solve the problem of finding the minimum operations to make all elements of an integer array divisible by three, we can break down the approach into a few clear steps:
+
+### Main Idea:
+The key insight is to recognize how each number's remainder when divided by 3 (i.e., `num % 3`) determines the number of operations needed to make it divisible by 3. Specifically:
+- If `num % 3 == 0`, no operations are needed.
+- If `num % 3 == 1`, we can either subtract 1 (1 operation) or add 2 (2 operations).
+- If `num % 3 == 2`, we can either subtract 2 (2 operations) or add 1 (1 operation).
+
+### Steps:
+1. **Initialize a Counter**: Start with a counter set to zero to keep track of the total operations required.
+2. **Iterate through the Array**: For each element in the array, compute its remainder when divided by 3.
+3. **Update the Counter**: Based on the remainder:
+   - If the remainder is 0, do nothing.
+   - If the remainder is 1, add 1 to the counter (for subtraction) or 2 (for addition), but we choose the minimum which is 1.
+   - If the remainder is 2, add 1 to the counter (for addition) or 2 (for subtraction), choosing the minimum which is also 1.
+4. **Return the Result**: After processing all elements, the counter will hold the minimum number of operations needed.
+
+### Data Structures:
+- A simple integer counter is sufficient to keep track of the total operations. No complex data structures are needed due to the straightforward nature of the calculations.
+
+### Complexity:
+- **Time Complexity**: O(n), where n is the length of the input array `nums`. We traverse the array once to compute the operations.
+- **Space Complexity**: O(1), as we only use a constant amount of space for the counter, regardless of the input size.
+
+This approach is efficient and straightforward, leveraging modular arithmetic to minimize operations effectively.

Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three/solution.java

@@ -0,0 +1,12 @@
+class Solution {
+    public int minOperations(int[] nums) {
+        int operations = 0;
+        for (int num : nums) {
+            int remainder = num % 3;
+            if (remainder != 0) {
+                operations += Math.min(remainder, 3 - remainder);
+            }
+        }
+        return operations;
+    }
+}

Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three/solution.js

@@ -0,0 +1,10 @@
+function minOperations(nums) {
+    let operations = 0;
+    for (let num of nums) {
+        const remainder = num % 3;
+        if (remainder !== 0) {
+            operations += Math.min(remainder, 3 - remainder);
+        }
+    }
+    return operations;
+}

Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three/solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def minOperations(self, nums: List[int]) -> int:
+        operations = 0
+        for num in nums:
+            remainder = num % 3
+            operations += min(remainder, 3 - remainder)
+        return operations

README.md

@@ -286,3 +286,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2025-11-19 — [Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/) (Easy) → `Easy/2025-11-19-2154-Keep-Multiplying-Found-Values-by-Two`
 - 2025-11-20 — [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/) (Hard) → `Hard/2025-11-20-757-Set-Intersection-Size-At-Least-Two`
 - 2025-11-21 — [Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) (Medium) → `Medium/2025-11-21-1930-Unique-Length-3-Palindromic-Subsequences`
+- 2025-11-22 — [Find Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/find-minimum-operations-to-make-all-elements-divisible-by-three/) (Easy) → `Easy/2025-11-22-3190-Find-Minimum-Operations-to-Make-All-Elements-Divisible-by-Three`