chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Medium/2025-11-10-3542-Minimum-Operations-to-Convert-All-Elements-to-Zero/explanation.md

@@ -0,0 +1,30 @@
+# Minimum Operations to Convert All Elements to Zero (Medium)
+
+**Problem ID:** 3542  
+**Date:** 2025-11-10  
+**Link:** https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/
+
+## Approach
+
+To solve the problem of converting all elements in the array to zero with the minimum number of operations, we can follow a systematic approach:
+
+### Main Idea:
+The key observation is that each unique non-negative integer in the array can be treated independently. By identifying the unique integers and their occurrences, we can minimize the number of operations required to set all elements to zero.
+
+### Steps to Solve the Problem:
+
+1. **Identify Unique Elements**: First, we need to determine the unique non-negative integers present in the array. This can be efficiently done using a set or a dictionary to track occurrences.
+
+2. **Count Operations**: For each unique integer, we need to perform operations to set all its occurrences to zero. The number of operations required is equal to the number of unique integers present in the array. This is because we can always select a subarray that contains all occurrences of a particular integer and set them to zero in one operation.
+
+3. **Return Result**: The final result is simply the count of unique non-negative integers, as each will require one operation to be set to zero.
+
+### Data Structures:
+- **Set or Dictionary**: To store unique integers and count them efficiently. This allows for O(1) average time complexity for insertions and lookups.
+
+### Complexity Analysis:
+- **Time Complexity**: O(n), where n is the length of the input array. This is due to the need to iterate through the array to collect unique integers.
+- **Space Complexity**: O(k), where k is the number of unique integers in the array. In the worst case, this could be O(n) if all elements are unique.
+
+### Conclusion:
+By leveraging the properties of unique integers and their occurrences, we can efficiently determine the minimum number of operations required to convert all elements to zero. This approach is optimal and scales well with the input size constraints.

Medium/2025-11-10-3542-Minimum-Operations-to-Convert-All-Elements-to-Zero/solution.java

@@ -0,0 +1,14 @@
+import java.util.HashSet;
+import java.util.Set;
+
+class Solution {
+    public int minimumOperations(int[] nums) {
+        Set<Integer> uniqueNonZero = new HashSet<>();
+        for (int num : nums) {
+            if (num != 0) {
+                uniqueNonZero.add(num);
+            }
+        }
+        return uniqueNonZero.size();
+    }
+}

Medium/2025-11-10-3542-Minimum-Operations-to-Convert-All-Elements-to-Zero/solution.js

@@ -0,0 +1,5 @@
+var minimumOperations = function(nums) {
+    const uniqueNums = new Set(nums);
+    uniqueNums.delete(0);
+    return uniqueNums.size;
+};

Medium/2025-11-10-3542-Minimum-Operations-to-Convert-All-Elements-to-Zero/solution.py

@@ -0,0 +1,5 @@
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+        unique_nums = set(nums)
+        unique_nums.discard(0)
+        return len(unique_nums)

README.md

@@ -274,3 +274,4 @@ Through completing the Blind 75 and NeetCode 150, you will have mastered:
 - 2025-11-07 — [Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city/) (Hard) → `Hard/2025-11-07-2528-Maximize-the-Minimum-Powered-City`
 - 2025-11-08 — [Minimum One Bit Operations to Make Integers Zero](https://leetcode.com/problems/minimum-one-bit-operations-to-make-integers-zero/) (Hard) → `Hard/2025-11-08-1611-Minimum-One-Bit-Operations-to-Make-Integers-Zero`
 - 2025-11-09 — [Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/) (Easy) → `Easy/2025-11-09-2169-Count-Operations-to-Obtain-Zero`
+- 2025-11-10 — [Minimum Operations to Convert All Elements to Zero](https://leetcode.com/problems/minimum-operations-to-convert-all-elements-to-zero/) (Medium) → `Medium/2025-11-10-3542-Minimum-Operations-to-Convert-All-Elements-to-Zero`