Create Split Array

Author: akshayavb99

Course 2 - Data Structures in JAVA/Test 1/Split Array

@@ -0,0 +1,70 @@
+/*
+Given an integer array A of size N, check if the input array can be splitted in two parts such that -
+- Sum of both parts is equal
+- All elements in the input, which are divisible by 5 should be in same group.
+- All elements in the input, which are divisible by 3 (but not divisible by 5) should be in other group.
+- Elements which are neither divisible by 5 nor by 3, can be put in any group.
+Groups can be made with any set of elements, i.e. elements need not to be continuous. And you need to consider each and every element of input array in some group.
+Return true, if array can be split according to the above rules, else return false.
+Note : You will get marks only if all the test cases are passed.
+
+Input Format :
+Line 1 : Integer N (size of array)
+Line 2 : Array A elements (separated by space)
+
+Output Format :
+true or false
+
+Constraints :
+1 <= N <= 50
+
+Sample Input 1 :
+2
+1 2
+Sample Output 1 :
+false
+
+Sample Input 2 :
+3
+1 4 3
+Sample Output 2 :
+true
+*/
+
+public class solution {
+
+	public static boolean splitArray(int input[]) {
+		/* Your class should be named solution
+		* Don't write main().
+		* Don't read input, it is passed as function argument.
+		* Return output and don't print it.
+		* Taking input and printing output is handled automatically.
+		*/
+		return splitArray(input,0,0,0);
+	}
+    
+     public static boolean splitArray(int arr[], int si, int lsum, int rsum) 
+	{ 
+         //lsum for sum of numbers divisible by 5 and rsum for sum of numbers divisible by 3
+  
+    	if (si == arr.length) 
+        {
+            return lsum == rsum;
+        }
+         
+    	if (arr[si] % 5 == 0)
+        {
+            lsum += arr[si];
+        }
+        else if (arr[si] % 3 == 0) 
+        {
+            rsum += arr[si]; 
+        }
+        else
+        {
+            return splitArray(arr,si+1, lsum+arr[si], rsum)  || splitArray(arr,si+1,lsum,rsum+arr[si]);
+        }
+         
+    	return splitArray(arr,si+1,lsum,rsum); 
+	} 
+}