chore: add LeetCode daily solution

Author: TechnoBlogger14o3

Medium/2025-10-02-3100-Water-Bottles-II/explanation.md

@@ -0,0 +1,26 @@
+# Water Bottles II (Medium)
+
+**Problem ID:** 3100  
+**Date:** 2025-10-02  
+**Link:** https://leetcode.com/problems/water-bottles-ii/
+
+## Approach
+
+To solve the "Water Bottles II" problem, we can use a greedy approach to maximize the number of water bottles consumed through drinking and exchanging empty bottles for full ones.
+
+### Main Idea:
+1. **Initial Setup**: Start with the given number of full bottles (`numBottles`) and initialize a counter for the total number of bottles drunk.
+2. **Drinking and Exchanging**: In each iteration:
+   - Drink all the full bottles available, adding to the total count of bottles drunk.
+   - Convert all the full bottles to empty bottles.
+   - Check if the number of empty bottles is sufficient to perform an exchange. If so, exchange the empty bottles for full ones, which also increases the `numExchange` count by one.
+3. **Repeat**: Continue this process until there are not enough empty bottles to perform any exchanges.
+
+### Data Structures:
+- Use simple integer variables to keep track of the number of full bottles, empty bottles, and the total count of bottles drunk. No complex data structures are needed due to the straightforward nature of the problem.
+
+### Complexity:
+- **Time Complexity**: O(n), where n is the number of times we can drink and exchange bottles. Given the constraints (both `numBottles` and `numExchange` can go up to 100), this results in a manageable number of iterations.
+- **Space Complexity**: O(1), as we are only using a fixed number of variables regardless of the input size.
+
+This approach effectively simulates the process of drinking and exchanging bottles, ensuring that we maximize the total number of bottles consumed while adhering to the exchange rules.

Medium/2025-10-02-3100-Water-Bottles-II/solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int numWaterBottles(int numBottles, int numExchange) {
+        int totalDrunk = 0;
+        int emptyBottles = 0;
+
+        while (numBottles > 0) {
+            totalDrunk += numBottles;
+            emptyBottles += numBottles;
+            numBottles = emptyBottles / numExchange;
+            emptyBottles %= numExchange;
+        }
+
+        return totalDrunk;
+    }
+}

Medium/2025-10-02-3100-Water-Bottles-II/solution.js

@@ -0,0 +1,12 @@
+var numWaterBottles = function(numBottles, numExchange) {
+    let totalDrunk = numBottles;
+    let emptyBottles = numBottles;
+
+    while (emptyBottles >= numExchange) {
+        const newBottles = Math.floor(emptyBottles / numExchange);
+        totalDrunk += newBottles;
+        emptyBottles = newBottles + (emptyBottles % numExchange);
+    }
+
+    return totalDrunk;
+};

Medium/2025-10-02-3100-Water-Bottles-II/solution.py

@@ -0,0 +1,12 @@
+class Solution:
+    def numWaterBottles(self, numBottles: int, numExchange: int) -> int:
+        total_drunk = 0
+        empty_bottles = 0
+        
+        while numBottles > 0:
+            total_drunk += numBottles
+            empty_bottles += numBottles
+            numBottles = empty_bottles // numExchange
+            empty_bottles %= numExchange
+        
+        return total_drunk

README.md

@@ -164,3 +164,4 @@ Each problem includes:
 - 2025-09-29 — [Minimum Score Triangulation of Polygon](https://leetcode.com/problems/minimum-score-triangulation-of-polygon/) (Medium) → `Medium/2025-09-29-1039-Minimum-Score-Triangulation-of-Polygon`
 - 2025-09-30 — [Find Triangular Sum of an Array](https://leetcode.com/problems/find-triangular-sum-of-an-array/) (Medium) → `Medium/2025-09-30-2221-Find-Triangular-Sum-of-an-Array`
 - 2025-10-01 — [Water Bottles](https://leetcode.com/problems/water-bottles/) (Easy) → `Easy/2025-10-01-1518-Water-Bottles`
+- 2025-10-02 — [Water Bottles II](https://leetcode.com/problems/water-bottles-ii/) (Medium) → `Medium/2025-10-02-3100-Water-Bottles-II`