From 660d86e14ba14a9c582f8ce11bd5c91486e8e54a Mon Sep 17 00:00:00 2001
From: Mayank goel <mayankgoyal662@gmail.com>
Date: Tue, 6 Oct 2020 00:13:23 +0530
Subject: [PATCH] Create SherlockAndArray.cpp

---
 .../cppSolutions/Array/SherlockAndArray.cpp   | 74 +++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 HackerRank/ProblemSolving/cppSolutions/Array/SherlockAndArray.cpp

diff --git a/HackerRank/ProblemSolving/cppSolutions/Array/SherlockAndArray.cpp b/HackerRank/ProblemSolving/cppSolutions/Array/SherlockAndArray.cpp
new file mode 100644
index 00000000..598d9fd0
--- /dev/null
+++ b/HackerRank/ProblemSolving/cppSolutions/Array/SherlockAndArray.cpp
@@ -0,0 +1,74 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+/*---------THE PROBLEM--------*/
+
+// HackerRank - Sherlock and Array
+
+// Link - https://www.hackerrank.com/challenges/sherlock-and-array/problem
+
+/*--------SOLUTION---------*/
+
+// function to check whether an array is Sherlock's array or not
+//It return "YES" if its a Sherlock's array else "NO"
+string balancedSums(vector<int> arr)
+{
+    int n,i,j,sr,sl;
+    n=arr.capacity();
+    i=0,j=n-1;
+    sr=arr[j];
+    sl=arr[i];
+    while(i<j)
+    {
+        if(sl<sr)
+        {
+            i++;
+            sl=sl+arr[i];
+        }
+        else 
+        {
+            j--;
+            sr=sr+arr[j];
+        }
+    }
+    if(sl==sr)
+    return "YES";
+    else
+    return "NO";
+
+}
+
+/*-----------TEST CASE-----------*/
+
+//Example 1:
+
+//Input: 
+//		 2
+//		 3
+//		 [1,2,3]
+//		 4
+//		 [1,2,3,3]
+
+//Output: 
+//		 NO
+//		 YES
+
+/*----------COMPLEXITY------------*/
+// O(n) Time complexity, No extra space used
+
+/*---Driver Code---*/
+int main(void)
+{
+	int test;
+	cin>>test;
+	while(test--)
+	{
+		int n;
+		cin>>n;
+		vector<int> arr(n);
+		for(int i=0;i<n;i++)
+		cin>>arr[i];
+		cout<<balancedSums(arr)<<endl;
+	}
+}