Arrays 10: Equilibrium Point | Must Do Coding Questions | Interview Preparation | GeeksForGeeks

This video contains Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, …
from geeksforgeeks platform.

website link:

Topics covered in this video series are:
1.Arrays
2.String
3.Linked List
4.Stack and Queue
5.Tree and BST
6.Heap
7.Recursion
8.Hashing
9.Graph
10.Greedy
11.Dynamic Programming
12.Divide and Conquer
13.Backtracking
14.Bit Magic

Arrays:
10. Equilibrium Point

Code Link:

Complete Playlist:

Intro Music :

[saurabhchaturvedi]

Such a simple visualization and algorithm to understand the equilibrium point problem !!! Thanks !!

[funcode-twcg]

Short and Simple !! thanks for explaination ;)

[surajrao]

thank you, visualisation process was too good

[amanrathour]

another approach for O(N) SOLN
public static int equilibriumPoint(long arr[], int n)
{
if(arr.length==1)
return 1;

long sum[]=new long[n];

sum[0]= arr[0];

for(int i=1;i<n;i++)
{
sum[i]=sum[i-1]+arr[i];
}

for(int i=1;i<n;i++)
{

return i+1;
}

return -1;
}
}

[tejaskumar]

int EquilibriumPoint(int n, int arr[]){
int lsum=0;
int sum=0;
int pos=-1;

for(int i=0;i<n;i++){
sum+=arr[i];
}
for(int i=0;i<n;i++){

if(lsum==sum-arr[i]){ //doubt line
pos=i+1;
break;
}
lsum+=arr[i];

}
return pos;

}
can you tell the error in the doubt line.Its not giving the right output