Create November-07.cpp

November 2024 GFG SOLUTION/November-07.cpp

@@ -0,0 +1,69 @@
+//{ Driver Code Starts
+#include <bits/stdc++.h>
+using namespace std;
+
+
+// } Driver Code Ends
+// User function Template for C++
+//  Class Solution to contain the method for solving the problem.
+class Solution {
+  public:
+    vector<int> findSplit(vector<int>& arr) {
+        int n = arr.size();
+        int totalSum = accumulate(arr.begin(), arr.end(), 0);
+
+        if (totalSum % 3 != 0)
+            return {-1, -1};
+
+        int target = totalSum / 3;
+        int currentSum = 0;
+        int countFirst = 0;  
+
+        for (int i = 0; i < n; ++i) {
+            currentSum += arr[i];
+
+            if (currentSum == 2 * target && countFirst > 0)
+                return {countFirst - 1, i};  
+
+            if (currentSum == target) {
+                countFirst++;  
+            }
+        }
+
+        return {-1, -1};
+    }
+};
+
+//{ Driver Code Starts.
+
+int main() {
+    int test_cases;
+    cin >> test_cases;
+    cin.ignore();
+    while (test_cases--) {
+        string input;
+        vector<int> arr;
+
+        // Read the array from input line
+        getline(cin, input);
+        stringstream ss(input);
+        int number;
+        while (ss >> number) {
+            arr.push_back(number);
+        }
+
+        // Solution instance to invoke the function
+        Solution ob;
+        vector<int> result = ob.findSplit(arr);
+
+        // Output result
+        if (result[0] == -1 && result[1] == -1) {
+            cout << "false" << endl;
+        } else {
+            cout << "true" << endl;
+        }
+    }
+    return 0;
+}
+
+// } Driver Code Ends