Given, an array of size n. Find an element that divides the array into two sub-arrays with equal sums.
Examples:
Input: 1 4 2 5 0
Output: 2
Explanation: If 2 is the partition, subarrays are : [1, 4] and [5]
Input: 2 3 4 1 4 5
Output: 1
Explanation: If 1 is the partition, Subarrays are : [2, 3, 4] and [4, 5]
Input: 1 2 3
Output: -1
Explanation: No sub-arrays possible. return -1
Method 1 (Simple)
Consider every element starting from the second element. Compute the sum of elements on its left and the sum of elements on its right. If these two sums are the same, return the element.
Steps to solve the problem:
1. iterate through i=1 to n:
*declare a leftsum variable to zero.
*iterate through i-1 till zero and add array element to leftsum.
*declare a rightsum variable to zero.
*iterate through i+1 till n and add array element to rightsum.
*check if leftsum is equal to rightsum then return arr[i].
2. return -1 in case of no point.
C++
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
int findElement(int arr[], int n)
{
for (int i = 1; i < n; i++) {
int leftSum = 0;
for (int j = i - 1; j >= 0; j--) {
leftSum += arr[j];
}
int rightSum = 0;
for (int k = i + 1; k < n; k++) {
rightSum += arr[k];
}
if (leftSum == rightSum) {
return arr[i];
}
}
return -1;
}
int main()
{
int arr1[] = { 1, 4, 2, 5 };
int n1 = sizeof(arr1) / sizeof(arr1[0]);
cout << findElement(arr1, n1) << "\n";
int arr2[] = { 2, 3, 4, 1, 4, 5 };
int n2 = sizeof(arr2) / sizeof(arr2[0]);
cout << findElement(arr2, n2);
return 0;
}
|
Java
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
class GFG {
static int findElement(int arr[], int n)
{
List<Integer> list
= Arrays.stream(arr).boxed().collect(
Collectors.toList());
for (int i = 1; i <= n; i++) {
int leftSum = list.subList(0, i)
.stream()
.mapToInt(x -> x)
.sum();
int rightSum = list.subList(i + 1, n)
.stream()
.mapToInt(x -> x)
.sum();
if (leftSum == rightSum)
return list.get(i);
}
return -1;
}
public static void main(String[] args)
{
int arr1[] = { 1, 4, 2, 5 };
int n1 = arr1.length;
System.out.println(findElement(arr1, n1));
int arr2[] = { 2, 3, 4, 1, 4, 5 };
int n2 = arr2.length;
System.out.println(findElement(arr2, n2));
}
}
|
Python3
def findElement(arr, n):
for i in range(1, n):
leftSum = sum(arr[0:i])
rightSum = sum(arr[i+1:])
if(leftSum == rightSum):
return arr[i]
return -1
if __name__ == "__main__":
arr = [1, 4, 2, 5]
n = len(arr)
print(findElement(arr, n))
arr = [2, 3, 4, 1, 4, 5]
n = len(arr)
print(findElement(arr, n))
|
C#
using System;
public class GFG {
static int findElement(int[] arr, int n)
{
for (int i = 1; i < n; i++) {
int leftSum = 0;
for (int j = i - 1; j >= 0; j--) {
leftSum += arr[j];
}
int rightSum = 0;
for (int k = i + 1; k < n; k++) {
rightSum += arr[k];
}
if (leftSum == rightSum) {
return arr[i];
}
}
return -1;
}
static public void Main()
{
int[] arr1 = { 1, 4, 2, 5 };
int n1 = arr1.Length;
Console.WriteLine(findElement(arr1, n1));
int[] arr2 = { 2, 3, 4, 1, 4, 5 };
int n2 = arr2.Length;
Console.WriteLine(findElement(arr2, n2));
}
}
|
Javascript
<script>
function findElement(arr , n)
{
for(i = 1; i < n; i++){
let leftSum = 0;
for(j = i-1; j >= 0; j--){
leftSum += arr[j];
}
let rightSum = 0;
for(k = i+1; k < n; k++){
rightSum += arr[k];
}
if(leftSum === rightSum){
return arr[i];
}
}
return -1;
}
var arr = [ 1, 4, 2, 5 ];
var n = arr.length;
document.write(findElement(arr, n));
document.write("<br><br>")
var arr = [ 2, 3, 4, 1, 4, 5 ];
var n = arr.length;
document.write(findElement(arr, n));
</script>
|
Time Complexity: O(n^2)
Auxiliary Space: O(1)
Method 2 (Using Prefix and Suffix Arrays) :
We form a prefix and suffix sum arrays
Given array: 1 4 2 5
Prefix Sum: 1 5 7 12
Suffix Sum: 12 11 7 5
Now, we will traverse both prefix arrays.
The index at which they yield equal result,
is the index where the array is partitioned
with equal sum.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int findElement(int arr[], int n)
{
int prefixSum[n];
prefixSum[0] = arr[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + arr[i];
int suffixSum[n];
suffixSum[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--)
suffixSum[i] = suffixSum[i + 1] + arr[i];
for (int i = 1; i < n - 1; i++)
if (prefixSum[i] == suffixSum[i])
return arr[i];
return -1;
}
int main()
{
int arr[] = { 1, 4, 2, 5 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << findElement(arr, n);
return 0;
}
|
Java
public class GFG {
static int findElement(int arr[], int n)
{
int[] prefixSum = new int[n];
prefixSum[0] = arr[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + arr[i];
int[] suffixSum = new int[n];
suffixSum[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--)
suffixSum[i] = suffixSum[i + 1] + arr[i];
for (int i = 1; i < n - 1; i++)
if (prefixSum[i] == suffixSum[i])
return arr[i];
return -1;
}
public static void main(String args[])
{
int arr[] = { 1, 4, 2, 5 };
int n = arr.length;
System.out.println(findElement(arr, n));
}
}
|
Python 3
def findElement(arr, n) :
prefixSum = [0] * n
prefixSum[0] = arr[0]
for i in range(1, n) :
prefixSum[i] = prefixSum[i - 1] + arr[i]
suffixSum = [0] * n
suffixSum[n - 1] = arr[n - 1]
for i in range(n - 2, -1, -1) :
suffixSum[i] = suffixSum[i + 1] + arr[i]
for i in range(1, n - 1, 1) :
if prefixSum[i] == suffixSum[i] :
return arr[i]
return -1
if __name__ == "__main__" :
arr = [ 1, 4, 2, 5]
n = len(arr)
print(findElement(arr, n))
|
C#
using System;
class GFG
{
static int findElement(int []arr,
int n)
{
int[] prefixSum = new int[n];
prefixSum[0] = arr[0];
for (int i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] +
arr[i];
int[] suffixSum = new int[n];
suffixSum[n - 1] = arr[n - 1];
for (int i = n - 2; i >= 0; i--)
suffixSum[i] = suffixSum[i + 1] +
arr[i];
for (int i = 1; i < n - 1; i++)
if (prefixSum[i] == suffixSum[i])
return arr[i];
return -1;
}
public static void Main()
{
int []arr = { 1, 4, 2, 5 };
int n = arr.Length;
Console.WriteLine(findElement(arr, n));
}
}
|
PHP
<?php
function findElement(&$arr, $n)
{
$prefixSum = array_fill(0, $n, NULL);
$prefixSum[0] = $arr[0];
for ($i = 1; $i < $n; $i++)
$prefixSum[$i] = $prefixSum[$i - 1] +
$arr[$i];
$suffixSum = array_fill(0, $n, NULL);
$suffixSum[$n - 1] = $arr[$n - 1];
for ($i = $n - 2; $i >= 0; $i--)
$suffixSum[$i] = $suffixSum[$i + 1] +
$arr[$i];
for ($i = 1; $i < $n - 1; $i++)
if ($prefixSum[$i] == $suffixSum[$i])
return $arr[$i];
return -1;
}
$arr = array( 1, 4, 2, 5 );
$n = sizeof($arr);
echo findElement($arr, $n);
?>
|
Javascript
<script>
function findElement(arr , n)
{
var prefixSum = Array(n).fill(0);
prefixSum[0] = arr[0];
for (i = 1; i < n; i++)
prefixSum[i] = prefixSum[i - 1] + arr[i];
var suffixSum = Array(n).fill(0);
suffixSum[n - 1] = arr[n - 1];
for (i = n - 2; i >= 0; i--)
suffixSum[i] = suffixSum[i + 1] + arr[i];
for (i = 1; i < n - 1; i++)
if (prefixSum[i] == suffixSum[i])
return arr[i];
return -1;
}
var arr = [ 1, 4, 2, 5 ];
var n = arr.length;
document.write(findElement(arr, n));
</script>
|
Time Complexity: O(n)
Auxiliary Space: O(n)
Method 3 (Space efficient)
We calculate the sum of the whole array except the first element in right_sum, considering it to be the partitioning element. Now, we traverse the array from left to right, subtracting an element from right_sum and adding an element to left_sum. At the point where right_sum equals left_sum, we get the partition.
Below is the implementation :
C++
#include <bits/stdc++.h>
using namespace std;
int findElement(int arr[], int size)
{
int right_sum = 0, left_sum = 0;
for (int i = 1; i < size; i++)
right_sum += arr[i];
for (int i = 0, j = 1; j < size; i++, j++) {
right_sum -= arr[j];
left_sum += arr[i];
if (left_sum == right_sum)
return arr[i + 1];
}
return -1;
}
int main()
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = sizeof(arr) / sizeof(arr[0]);
cout << findElement(arr, size);
return 0;
}
|
Java
public class GFG {
static int findElement(int arr[], int size)
{
int right_sum = 0, left_sum = 0;
for (int i = 1; i < size; i++)
right_sum += arr[i];
for (int i = 0, j = 1; j < size; i++, j++) {
right_sum -= arr[j];
left_sum += arr[i];
if (left_sum == right_sum)
return arr[i + 1];
}
return -1;
}
public static void main(String args[])
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = arr.length;
System.out.println(findElement(arr, size));
}
}
|
Python 3
def findElement(arr, size) :
right_sum, left_sum = 0, 0
for i in range(1, size) :
right_sum += arr[i]
i, j = 0, 1
while j < size :
right_sum -= arr[j]
left_sum += arr[i]
if left_sum == right_sum :
return arr[i + 1]
j += 1
i += 1
return -1
if __name__ == "__main__" :
arr = [ 2, 3, 4, 1, 4, 5]
n = len(arr)
print(findElement(arr, n))
|
C#
using System;
class GFG
{
static int findElement(int []arr,
int size)
{
int right_sum = 0,
left_sum = 0;
for (int i = 1; i < size; i++)
right_sum += arr[i];
for (int i = 0, j = 1;
j < size; i++, j++)
{
right_sum -= arr[j];
left_sum += arr[i];
if (left_sum == right_sum)
return arr[i + 1];
}
return -1;
}
public static void Main()
{
int []arr = {2, 3, 4, 1, 4, 5};
int size = arr.Length;
Console.WriteLine(findElement(arr, size));
}
}
|
PHP
<?php
function findElement(&$arr, $size)
{
$right_sum = 0;
$left_sum = 0;
for ($i = 1; $i < $size; $i++)
$right_sum += $arr[$i];
for ($i = 0, $j = 1;
$j < $size; $i++, $j++)
{
$right_sum -= $arr[$j];
$left_sum += $arr[$i];
if ($left_sum == $right_sum)
return $arr[$i + 1];
}
return -1;
}
$arr = array( 2, 3, 4, 1, 4, 5 );
$size = sizeof($arr);
echo findElement($arr, $size);
?>
|
Javascript
<script>
function findElement(arr) {
let right_sum = 0, left_sum = 0;
for (let i = 1; i < arr.length; i++)
right_sum += arr[i];
for (let i = 0, j = 1; j < arr.length; i++, j++) {
right_sum -= arr[j];
left_sum += arr[i];
if (left_sum === right_sum)
return arr[i + 1];
}
return -1;
}
let arr = [ 2, 3, 4, 1, 4, 5 ];
document.write(findElement(arr));
</script>
|
Time complexity: O(n)
Auxiliary Space: O(1)
Method 4 (Both Time and Space Efficient)
We define two pointers i and j to traverse the array from left and right,
left_sum and right_sum to store sum from right and left respectively
If left_sum is lesser then increment i and if right_sum is lesser then decrement j
and, find a position where left_sum == right_sum and i and j are next to each other
Note: This solution is only applicable if the array contains only positive elements.
Below is the implementation of the above approach:
C++
#include<bits/stdc++.h>
using namespace std;
int findElement(int arr[],
int size)
{
int right_sum = 0,
left_sum = 0;
left_sum = 0;
right_sum = 0;
int i = -1, j = -1;
for(i = 0, j = size - 1;
i < j; i++, j--)
{
left_sum += arr[i];
right_sum += arr[j];
while(left_sum < right_sum &&
i < j)
{
i++;
left_sum += arr[i];
}
while(right_sum < left_sum &&
i < j)
{
j--;
right_sum += arr[j];
}
}
if(left_sum == right_sum && i == j)
return arr[i];
else
return -1;
}
int main()
{
int arr[] = {2, 3, 4,
1, 4, 5};
int size = sizeof(arr) /
sizeof(arr[0]);
cout << (findElement(arr, size));
}
|
Java
public class Gfg {
static int findElement(int arr[], int size)
{
int right_sum = 0, left_sum = 0;
left_sum = 0;
right_sum=0;
int i = -1, j = -1;
for( i = 0, j = size-1 ; i < j ; i++, j-- ){
left_sum += arr[i];
right_sum += arr[j];
while(left_sum < right_sum && i < j){
i++;
left_sum += arr[i];
}
while(right_sum < left_sum && i < j){
j--;
right_sum += arr[j];
}
}
if(left_sum == right_sum && i == j)
return arr[i];
else
return -1;
}
public static void main(String args[])
{
int arr[] = {2, 3, 4, 1, 4, 5};
int size = arr.length;
System.out.println(findElement(arr, size));
}
}
|
Python3
def findElement(arr, size):
left_sum = 0;
right_sum = 0;
i = 0; j = -1;
j = size - 1;
while(i < j):
if(i < j):
left_sum += arr[i];
right_sum += arr[j];
while (left_sum < right_sum and
i < j):
i += 1;
left_sum += arr[i];
while (right_sum < left_sum and
i < j):
j -= 1;
right_sum += arr[j];
j -= 1
i += 1
if (left_sum == right_sum && i == j):
return arr[i];
else:
return -1;
if __name__ == '__main__':
arr = [2, 3, 4,
1, 4, 5];
size = len(arr);
print(findElement(arr, size));
|
C#
using System;
class GFG{
static int findElement(int []arr, int size)
{
int right_sum = 0, left_sum = 0;
left_sum = 0;
right_sum = 0;
int i = -1, j = -1;
for(i = 0, j = size - 1; i < j; i++, j--)
{
left_sum += arr[i];
right_sum += arr[j];
while (left_sum < right_sum && i < j)
{
i++;
left_sum += arr[i];
}
while (right_sum < left_sum && i < j)
{
j--;
right_sum += arr[j];
}
}
if (left_sum == right_sum && i == j)
return arr[i];
else
return -1;
}
public static void Main(String []args)
{
int []arr = { 2, 3, 4, 1, 4, 5 };
int size = arr.Length;
Console.WriteLine(findElement(arr, size));
}
}
|
Javascript
<script>
function findElement(arr , size) {
var right_sum = 0, left_sum = 0;
left_sum = 0;
right_sum = 0;
var i = -1, j = -1;
for (i = 0, j = size - 1; i < j; i++, j--) {
left_sum += arr[i];
right_sum += arr[j];
while (left_sum < right_sum && i < j) {
i++;
left_sum += arr[i];
}
while (right_sum < left_sum && i < j) {
j--;
right_sum += arr[j];
}
}
if (left_sum == right_sum && i == j)
return arr[i];
else
return -1;
}
var arr = [ 2, 3, 4, 1, 4, 5 ];
var size = arr.length;
document.write(findElement(arr, size));
</script>
|
Since all loops start traversing from the last updated i and j pointers and do not cross each other, they run n times in the end.
Time Complexity – O(n)
Auxiliary Space – O(1)
Method 5 (The efficient algorithm):
- Here we define two pointers to the array -> start = 0, end = n-1
- Two variables to take care of sum -> left_sum = 0, right_sum = 0
Here our algorithm goes like this:
- We initialize for loop till the entire size of the array
- Basically we check if left_sum > right_sum => add the current end element to the right_sum and decrement end
- If right_sum < left_sum => add the current start element to the left_sum and increment start
- By these two conditions, we make sure that left_sum and right_sum are nearly balanced, so we can arrive at our solution easily
- To make this work during all test cases we need to add a couple of conditional statements to our logic:
- If the equilibrium element is found our start will be equal to the end variable and left_sum will be equal right_sum => return the equilibrium element (here we say start == end because we increment/ decrement the pointer after adding the current start/ end value to respective sum. So if, equilibrium element is found start and end should be at the same location)
- If start is equal to end variable but left_sum is not equal right_sum => no equilibrium element return -1
- If left_sum is equal right_sum, but start is not equal to end => we are still in the middle of the algorithm even though we found that left_sum is equal right_sum we haven’t got that one required equilibrium element (So, in this case, add the current end element to the right_sum and decrement end (or) add the current start element to the left_sum and increment start, to make our algorithm continue further).
- Even here there is one test case that needs to be handled:
- When there is only one element in the array our algorithm exits without entering for a loop.
- So we can check if our functions enter the loop if not we can directly return the value as the answer.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int equilibriumPoint(int a[], int n)
{
int i = 0, start = 0, end = n - 1, left_sum = 0,
right_sum = 0;
for (i = 0; i < n; i++) {
if (start == end && right_sum == left_sum)
return a[start];
if (start == end)
return -1;
if (left_sum > right_sum) {
right_sum += a[end];
end--;
}
else if (right_sum > left_sum) {
left_sum += a[start];
start++;
}
else {
right_sum += a[end];
end--;
}
}
if (!i) {
return a[0];
}
}
int main()
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = sizeof(arr) / sizeof(arr[0]);
cout << (equilibriumPoint(arr, size));
}
|
Java
import java.io.*;
class GFG
{
static int equilibriumPoint(int a[], int n)
{
int i = 0, start = 0, end = n - 1, left_sum = 0,
right_sum = 0;
for (i = 0; i < n; i++)
{
if (start == end && right_sum == left_sum)
return a[start];
if (start == end)
return -1;
if (left_sum > right_sum)
{
right_sum += a[end];
end--;
}
else if (right_sum > left_sum)
{
left_sum += a[start];
start++;
}
else {
right_sum += a[end];
end--;
}
}
if (i == 0)
{
return a[0];
}
return -1;
}
public static void main (String[] args)
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = arr.length;
System.out.println(equilibriumPoint(arr, size));
}
}
|
Python3
def equilibriumPoint(a, n):
i,start,end,left_sum,right_sum = 0,0,n - 1,0,0
for i in range(n):
if (start == end and right_sum == left_sum):
return a[start]
if (start == end):
return -1
if (left_sum > right_sum):
right_sum += a[end]
end -= 1
elif (right_sum > left_sum):
left_sum += a[start]
start += 1
else:
right_sum += a[end]
end -= 1
if (not i):
return a[0]
arr = [ 2, 3, 4, 1, 4, 5 ]
size = len(arr)
print(equilibriumPoint(arr, size))
|
C#
using System;
public class GFG{
static int equilibriumPoint(int[] a, int n)
{
int i = 0, start = 0, end = n - 1, left_sum = 0,
right_sum = 0;
for (i = 0; i < n; i++)
{
if (start == end && right_sum == left_sum)
return a[start];
if (start == end)
return -1;
if (left_sum > right_sum)
{
right_sum += a[end];
end--;
}
else if (right_sum > left_sum)
{
left_sum += a[start];
start++;
}
else {
right_sum += a[end];
end--;
}
}
if (i == 0)
{
return a[0];
}
return -1;
}
static public void Main (){
int[] arr = { 2, 3, 4, 1, 4, 5 };
int size = arr.Length;
Console.WriteLine(equilibriumPoint(arr, size));
}
}
|
Javascript
<script>
function equilibriumPoint(a, n)
{
let i = 0, start = 0, end = n - 1, left_sum = 0,
right_sum = 0;
for (i = 0; i < n; i++) {
if (start == end && right_sum == left_sum)
return a[start];
if (start == end)
return -1;
if (left_sum > right_sum) {
right_sum += a[end];
end--;
}
else if (right_sum > left_sum) {
left_sum += a[start];
start++;
}
else {
right_sum += a[end];
end--;
}
}
if (!i) {
return a[0];
}
}
let arr = [ 2, 3, 4, 1, 4, 5 ];
let size = arr.length;
document.write(equilibriumPoint(arr, size));
</script>
|
Time complexity: O(n)
Auxiliary Space: O(1)
Method 6: We can use divide and conquer to improve the number of traces to find an equilibrium point, as we know, most of the time a point comes from a mid, which can be considered as an idea to solve this problem
- We can consider that the equilibrium point is mid of the list
- If yes (left sum is equal to right sum) — best case – return the index +1 (as that would be actual count by human)
- If not check where the weight is inclined either the left side or right side
a) perform the increase and decrease to get the new sum and return the index when equal, Also return -1 if inclination changes to what we had in beginning:
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
int sum(int a[], int start, int end)
{
int result = 0;
for (int i = start; i < end; i++) {
result += a[i];
}
return result;
}
int equilibriumPoint(int A[], int n)
{
int index = n / 2;
int left_sum = sum(A, 0, index);
int right_sum = sum(A, index + 1, n);
if (left_sum == right_sum) {
return A[index];
}
else if (left_sum > right_sum) {
while (index >= 0) {
left_sum -= A[index - 1];
right_sum += A[index];
index -= 1;
if (right_sum > left_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
else if (right_sum > left_sum) {
while (index <= n - 1) {
left_sum += A[index];
right_sum -= A[index + 1];
index += 1;
if (left_sum > right_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
return -1;
}
int main()
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = sizeof(arr) / sizeof(arr[0]);
cout << (equilibriumPoint(arr, size));
}
|
Java
import java.io.*;
class GFG {
static int sum(int a[],int start,int end)
{
int result=0;
for(int i=start;i<end;i++)
{
result+=a[i];
}
return result;
}
public static int equilibriumPoint(int A[], int n) {
int index = n/2;
int left_sum = sum(A,0,index);
int right_sum = sum(A,index+1,n);
if(left_sum == right_sum)
{
return A[index];
}
else if(left_sum > right_sum)
{
while(index >= 0)
{
left_sum -= A[index-1];
right_sum += A[index];
index -= 1;
if(right_sum > left_sum)
return -1;
else if(left_sum == right_sum)
return A[index];
}
}
else if(right_sum > left_sum)
{
while(index <= n-1)
{
left_sum += A[index];
right_sum -= A[index+1];
index += 1;
if (left_sum > right_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
return -1;
}
public static void main (String[] args)
{
int arr[] = { 2, 3, 4, 1, 4, 5 };
int size = arr.length;
System.out.println(equilibriumPoint(arr, size));
}
}
|
Python3
def sum(A):
result = 0
for item in A:
result += item
return result
def equilibriumPoint(A, N):
index = N // 2
left_sum = sum(A[:index])
right_sum = sum(A[index+1:])
if left_sum == right_sum:
return A[index]
elif left_sum > right_sum:
while(index >= 0):
left_sum -= A[index-1]
right_sum += A[index]
index -= 1
if right_sum > left_sum:
return -1
elif left_sum == right_sum:
return A[index]
elif right_sum > left_sum:
while(index <= N-1):
left_sum += A[index]
right_sum -= A[index+1]
index += 1
if left_sum > right_sum:
return -1
elif left_sum == right_sum:
return A[index]
else:
return -1
arr = [ 2, 3, 4, 1, 4, 5 ]
size = len(arr)
print(equilibriumPoint(arr, size))
|
C#
using System;
public class GFG{
static int sum(int[] A,int start,int end)
{
int result=0;
for(int i=start;i<end;i++)
{
result+=A[i];
}
return result;
}
static int equilibriumPoint(int[] A, int n)
{
int index = n / 2;
int left_sum = sum(A, 0, index);
int right_sum = sum(A, index + 1, n);
if (left_sum == right_sum) {
return A[index];
}
else if (left_sum > right_sum) {
while (index >= 0) {
left_sum -= A[index - 1];
right_sum += A[index];
index -= 1;
if (right_sum > left_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
else if (right_sum > left_sum) {
while (index <= n - 1) {
left_sum += A[index];
right_sum -= A[index + 1];
index += 1;
if (left_sum > right_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
return -1;
}
static public void Main (){
int[] arr = new int []{ 2, 3, 4, 1, 4, 5 };
int size = arr.Length;
Console.WriteLine(equilibriumPoint(arr, size));
}
}
|
Javascript
function sum(a, start, end)
{
let result = 0;
for (let i = start; i < end; i++) {
result += a[i];
}
return result;
}
function equilibriumPoint(A, n)
{
let index = n / 2;
let left_sum = sum(A, 0, index);
let right_sum = sum(A, index + 1, n);
if (left_sum == right_sum) {
return A[index];
}
else if (left_sum > right_sum) {
while (index >= 0) {
left_sum -= A[index - 1];
right_sum += A[index];
index -= 1;
if (right_sum > left_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
else if (right_sum > left_sum) {
while (index <= n - 1) {
left_sum += A[index];
right_sum -= A[index + 1];
index += 1;
if (left_sum > right_sum)
return -1;
else if (left_sum == right_sum)
return A[index];
}
}
return -1;
}
let arr = [ 2, 3, 4, 1, 4, 5 ];
let size = arr.length;
console.log(equilibriumPoint(arr, size));
|
Time complexity: O(n)
Auxiliary Space: O(1)