add solutions, explanation and update README of the day 2270

Author: Aarzoo

Algorithms/README.md

@@ -58,6 +58,7 @@
 | 2064            | Minimized Maximum of Products Distributed to Any Store  | [C++](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.cpp), [Java](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.java), [JavaScript](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.js), [Python](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.py), [Go](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.go) | [Explanation](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Explanation/explanation.md)   | Medium             |
 | 2070            | Most Beautiful Item for Each Query  | [C++](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.cpp), [Java](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.java), [JavaScript](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.js), [Python](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.py), [Go](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.go) | [Explanation](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Explanation/explanation.md)   | Medium             |
 | 2134            | Minimum Swaps to Group All 1's Together II  | [C++](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.cpp), [Java](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.java), [JavaScript](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.js), [Python](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.py), [Go](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.go) | [Explanation](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Explanation/explanation.md)   | Medium             |
+| 2270            | 2270. Number of Ways to Split Array  | [C++](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.cpp), [Java](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.js), [Python](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.py), [Go](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Explanation/explanation.md)   | Medium             |
 | 2275            | Largest Combination With Bitwise AND Greater Than Zero  | [C++](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.cpp), [Java](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.java), [JavaScript](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.js), [Python](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.py), [Go](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.go) | [Explanation](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Explanation/explanation.md)   | Medium             |
 | 2406            | Divide Intervals Into Minimum Number of Groups  | [C++](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.cpp), [Java](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.java), [JavaScript](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.js), [Python](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.py), [Go](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.go) | [Explanation](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Explanation/explanation.md)   | Medium             |
 | 2416            | Sum of Prefix Scores of Strings  | [C++](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.cpp), [Java](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.java), [JavaScript](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.js), [Python](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.py), [Go](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.go) | [Explanation](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Explanation/explanation.md)   | Hard             |

Algorithms/src/2270. Number of Ways to Split Array/Code/solution.cpp

@@ -0,0 +1,27 @@
+class Solution
+{
+public:
+    int waysToSplitArray(vector<int> &nums)
+    {
+        long long total_sum = 0; // Total sum of the array
+        for (int num : nums)
+        {
+            total_sum += num;
+        }
+
+        long long prefix_sum = 0; // Prefix sum
+        int count = 0;            // Count of valid splits
+
+        for (int i = 0; i < nums.size() - 1; i++)
+        {
+            prefix_sum += nums[i];
+            long long right_sum = total_sum - prefix_sum;
+            if (prefix_sum >= right_sum)
+            {
+                count++;
+            }
+        }
+
+        return count;
+    }
+};

Algorithms/src/2270. Number of Ways to Split Array/Code/solution.go

@@ -0,0 +1,19 @@
+func waysToSplitArray(nums []int) int {
+    totalSum := 0
+    for _, num := range nums {
+        totalSum += num
+    }
+    
+    prefixSum := 0
+    count := 0
+    
+    for i := 0; i < len(nums)-1; i++ {
+        prefixSum += nums[i]
+        rightSum := totalSum - prefixSum
+        if prefixSum >= rightSum {
+            count++
+        }
+    }
+    
+    return count
+}

Algorithms/src/2270. Number of Ways to Split Array/Code/solution.java

@@ -0,0 +1,21 @@
+class Solution {
+    public int waysToSplitArray(int[] nums) {
+        long totalSum = 0;
+        for (int num : nums) {
+            totalSum += num;
+        }
+
+        long prefixSum = 0;
+        int count = 0;
+
+        for (int i = 0; i < nums.length - 1; i++) {
+            prefixSum += nums[i];
+            long rightSum = totalSum - prefixSum;
+            if (prefixSum >= rightSum) {
+                count++;
+            }
+        }
+
+        return count;
+    }
+}

Algorithms/src/2270. Number of Ways to Split Array/Code/solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var waysToSplitArray = function (nums) {
+  let totalSum = nums.reduce((a, b) => a + b, 0); // Total sum of the array
+  let prefixSum = 0; // Prefix sum
+  let count = 0; // Count of valid splits
+
+  for (let i = 0; i < nums.length - 1; i++) {
+    prefixSum += nums[i];
+    let rightSum = totalSum - prefixSum;
+    if (prefixSum >= rightSum) {
+      count++;
+    }
+  }
+
+  return count;
+};

Algorithms/src/2270. Number of Ways to Split Array/Code/solution.py

@@ -0,0 +1,13 @@
+class Solution:
+    def waysToSplitArray(self, nums: List[int]) -> int:
+        total_sum = sum(nums)  # Total sum of the array
+        prefix_sum = 0  # Prefix sum
+        count = 0  # Count of valid splits
+
+        for i in range(len(nums) - 1):
+            prefix_sum += nums[i]
+            right_sum = total_sum - prefix_sum
+            if prefix_sum >= right_sum:
+                count += 1
+        
+        return count

Algorithms/src/2270. Number of Ways to Split Array/Explanation/explanation.md

@@ -0,0 +1,102 @@
+# Number of Ways to Split Array - Step-by-Step Explanation
+
+This README provides a detailed explanation of the solution for the problem **"Number of Ways to Split Array"**. Below, we go through the thought process and steps for each implementation in **C++**, **Java**, **JavaScript**, **Python**, and **Go**.
+
+---
+
+## 🚀 Problem Description  
+
+Given an array `nums`, count the number of ways to split the array into two non-empty parts such that the sum of the left part is **greater than or equal to** the sum of the right part.
+
+---
+
+## 🧠 Intuition  
+
+The idea is to calculate the sum of the left and right parts of the array for each split point and check if the left sum is greater than or equal to the right sum. By using **prefix sums**, we can avoid recalculating sums repeatedly and ensure the solution is efficient.
+
+---
+
+## 🛠️ Approach  
+
+1. Calculate the **total sum** of the entire array.  
+2. Use a **prefix sum** to keep track of the cumulative sum of elements from the start up to the current index.  
+3. At each split point (from index `0` to `n-2`), calculate the right sum as the difference between the total sum and the prefix sum.  
+4. Check if the left sum (prefix sum) is greater than or equal to the right sum. If yes, increase the count of valid splits.  
+5. Return the final count of valid splits.
+
+---
+
+## 📚 Step-by-Step Explanation  
+
+### **C++ Implementation**  
+
+1. **Calculate the total sum**: Start by iterating through the array to compute the total sum of all elements.  
+2. **Initialize variables**: Use a `prefix_sum` to store the cumulative sum of the left part and a `count` to keep track of valid splits.  
+3. **Iterate through the array**: For each split point, update the prefix sum with the current element.  
+4. **Compute the right sum**: Subtract the prefix sum from the total sum to get the right part's sum.  
+5. **Check the condition**: Compare the prefix sum with the right sum. If the prefix sum is greater than or equal to the right sum, increment the count.  
+6. **Return the result**: Once the loop finishes, return the count of valid splits.
+
+---
+
+### **Java Implementation**  
+
+1. **Calculate the total sum**: Use a loop to compute the total sum of all elements in the array.  
+2. **Initialize variables**: Create variables for `prefixSum` (to track the cumulative left sum) and `count` (to count valid splits).  
+3. **Iterate through the array**: Loop from the start of the array to the second-to-last element.  
+4. **Update the prefix sum**: Add the current element to the `prefixSum` during each iteration.  
+5. **Compute the right sum**: Subtract the `prefixSum` from the `totalSum` to get the right part's sum dynamically.  
+6. **Check the condition**: If the `prefixSum` is greater than or equal to the right sum, increment the `count`.  
+7. **Return the count**: After the loop, return the total number of valid splits.
+
+---
+
+### **JavaScript Implementation**  
+
+1. **Calculate the total sum**: Use the `reduce()` function to compute the sum of all elements in the array.  
+2. **Initialize variables**: Create variables `prefixSum` for the cumulative left sum and `count` to track valid splits.  
+3. **Iterate through the array**: Use a `for` loop to traverse the array, stopping at the second-to-last element.  
+4. **Update the prefix sum**: Add the current element to `prefixSum` in each iteration.  
+5. **Compute the right sum**: Subtract `prefixSum` from `totalSum` to dynamically calculate the sum of the right part.  
+6. **Check the condition**: Compare `prefixSum` with the right sum. If `prefixSum` is greater than or equal to the right sum, increment `count`.  
+7. **Return the count**: At the end of the loop, return the total count of valid splits.
+
+---
+
+### **Python Implementation**  
+
+1. **Calculate the total sum**: Use Python's `sum()` function to find the sum of all elements in the array.  
+2. **Initialize variables**: Create `prefix_sum` for the cumulative left sum and `count` to store the number of valid splits.  
+3. **Iterate through the array**: Loop through the array, stopping before the last element.  
+4. **Update the prefix sum**: Add the current element to `prefix_sum` during each iteration.  
+5. **Compute the right sum**: Subtract the `prefix_sum` from the `total_sum` to get the right part's sum.  
+6. **Check the condition**: If the `prefix_sum` is greater than or equal to the right sum, increment the `count`.  
+7. **Return the count**: After the loop finishes, return the total count of valid splits.
+
+---
+
+### **Go Implementation**  
+
+1. **Calculate the total sum**: Use a `for` loop to compute the sum of all elements in the array.  
+2. **Initialize variables**: Create `prefixSum` to store the left cumulative sum and `count` to track valid splits.  
+3. **Iterate through the array**: Loop through the array, stopping before the last element.  
+4. **Update the prefix sum**: Add the current element to `prefixSum` in each iteration.  
+5. **Compute the right sum**: Subtract `prefixSum` from `totalSum` to dynamically compute the right sum.  
+6. **Check the condition**: Compare `prefixSum` and the right sum. If `prefixSum` is greater than or equal to the right sum, increment `count`.  
+7. **Return the count**: At the end of the loop, return the total number of valid splits.
+
+---
+
+## ⚙️ Complexity Analysis  
+
+- **Time Complexity**:  
+  The algorithm runs in \(O(n)\) time, where \(n\) is the size of the array. This is because we iterate through the array once to calculate the total sum and once more to evaluate valid splits.  
+
+- **Space Complexity**:  
+  The solution uses \(O(1)\) extra space since we only use a few variables (`total_sum`, `prefix_sum`, `count`).
+
+---
+
+## ✨ Conclusion  
+
+This approach ensures optimal performance with minimal space usage, making it well-suited for large inputs. The use of prefix sums significantly reduces redundant computations, achieving \(O(n)\) efficiency across all implementations.

README.md

@@ -60,6 +60,7 @@ Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions
 | 2064            | Minimized Maximum of Products Distributed to Any Store  | [C++](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.cpp), [Java](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.java), [JavaScript](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.js), [Python](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.py), [Go](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.go) | [Explanation](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Explanation/explanation.md)   | Medium             |
 | 2070            | Most Beautiful Item for Each Query  | [C++](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.cpp), [Java](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.java), [JavaScript](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.js), [Python](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.py), [Go](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.go) | [Explanation](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Explanation/explanation.md)   | Medium             |
 | 2134            | Minimum Swaps to Group All 1's Together II  | [C++](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.cpp), [Java](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.java), [JavaScript](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.js), [Python](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.py), [Go](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.go) | [Explanation](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Explanation/explanation.md)   | Medium             |
+| 2270            | 2270. Number of Ways to Split Array  | [C++](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.cpp), [Java](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.js), [Python](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.py), [Go](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Explanation/explanation.md)   | Medium             |
 | 2275            | Largest Combination With Bitwise AND Greater Than Zero  | [C++](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.cpp), [Java](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.java), [JavaScript](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.js), [Python](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.py), [Go](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.go) | [Explanation](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Explanation/explanation.md)   | Medium             |
 | 2406            | Divide Intervals Into Minimum Number of Groups  | [C++](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.cpp), [Java](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.java), [JavaScript](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.js), [Python](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.py), [Go](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.go) | [Explanation](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Explanation/explanation.md)   | Medium             |
 | 2416            | Sum of Prefix Scores of Strings  | [C++](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.cpp), [Java](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.java), [JavaScript](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.js), [Python](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.py), [Go](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.go) | [Explanation](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Explanation/explanation.md)   | Hard             |