Input : Arr[] = { 1 , 2 , 3 , 4 , 5 , 5  }\r\nOutput :  { 1 2 3 4 } \r\n          { 5 , 5 }\r\n<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n
\n
\n
\n
Given an array of integers, find if it\u2019s possible to remove exactly one integer from the array that divides the array into two subarrays with the same sum. For Example,<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
\n
\n
\n
                           Input:  arr = [6<\/span>, 2<\/span>, 3<\/span>, 2<\/span>, 1<\/span>]\r\n                           Output:  true<\/span>\r\n<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n
\n
\n
\n
On removing element 2 at index 1, the array gets divided into two subarrays [6] and [3, 2, 1] having equal sum.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
<\/div>\n
\n
\n
Sample Code in Java<\/h2>\n
 
 <\/div> 
\/ Java program to split an array \/\/ into two equal sum subarrays import java.io.*;class Wikitechy {    \/\/ Returns split point. If     \/\/ not possible, then return -1.     static int findSplitPoint(int arr[], int n) {        int leftSum = 0;        \/\/ traverse array element         for (int i = 0; i < n; i++) {            \/\/ add current element to left Sum             leftSum += arr[i];            \/\/ find sum of rest array             \/\/ elements (rightSum)             int rightSum = 0;            for (int j = i + 1; j < n; j++)                rightSum += arr[j];            \/\/ split point index             if (leftSum == rightSum)                return i + 1;        }        \/\/ if it is not possible to         \/\/ split array into two parts         return -1;    }    \/\/ Prints two parts after finding     \/\/ split point using findSplitPoint()     static void printTwoParts(int arr[], int n) {        int splitPoint = findSplitPoint(arr, n);        if (splitPoint == -1 || splitPoint == n) {            System.out.println("Not Possible");            return;        }        for (int i = 0; i < n; i++) {            if (splitPoint == i)                System.out.println();            System.out.print(arr[i] + " ");        }    }    \/\/ Driver program     public static void main(String[] args) {        int arr[] = {1,1,0,2};        int n = arr.length;        printTwoParts(arr, n);    }}<\/code><\/pre> <\/div>\n
\n
\n
Output<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
1 1 \r\n0 2<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Answer : Given an array of integers greater than zero…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[4004],"tags":[4280,195,4289,491,4292,4279,4290,2212,4005,360,203,199,214,198,363,209,205,2936,222,4282,196,212,213,4293,4288,4278,4285,4295,4284,4291,4286,4281,4294,4283,4287,286,207,366,204,217,282,4023,483,15926,206,4296,200,197,280,364,968],"class_list":["post-663","post","type-post","status-publish","format-standard","hentry","category-java","tag-2d-array-java","tag-accenture-interview-questions-and-answers","tag-addition-program-in-java","tag-applied-materials-interview-questions-and-answers","tag-array-declaration","tag-array-declaration-in-java","tag-array-of-objects-in-java","tag-array-programs-in-java","tag-arraylist-java","tag-atos-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-technologies-interview-questions-and-answers","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-fis-global-business-solutions-india-pvt-ltd-interview-questions-and-answers","tag-flipkart-interview-questions-and-answers","tag-for-each-loop-java","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-infosys-technologies-interview-questions-and-answers","tag-java-8-reduce","tag-java-add-to-array","tag-java-array","tag-java-array-class","tag-java-array-example","tag-java-array-length","tag-java-array-methods","tag-java-foreach-array","tag-java-initialize-array","tag-java-print-array","tag-java-sort-array","tag-java-stream-sum","tag-lt-infotech-interview-questions-and-answers","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-peoplestrong-interview-questions-and-answers","tag-persistent-systems-interview-questions-and-answers","tag-rbs-india-de-interview-questions-and-answers","tag-reliance-industries-ltd-interview-questions-and-answers","tag-remaxys-infotech-interview-questions-and-answers","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-split-array-where-sum-of-left-hand-side-is-equal-to-sum-of-right-hand-side","tag-tech-mahindra-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-virtusa-consulting-services-pvt-ltd-interview-questions-and-answers","tag-wells-fargo-interview-questions-and-answers","tag-wipro-infotech-interview-questions-and-answers"],"yoast_head":"\n