Equilibrium Element in Array in o(n) time complexity ( Interview Question for FAANG companies)

[@hariprasadcr5936]

best simple and strightforward solution

[@Corporate_majdoor123]

i have an issue with this question for a long time now it is solved thanks sir

[@sarav-Frontend_Engineer]

Clear explanation! bro. Thank you!

[@devanshprakash8354]

Nicely explained sir thank you!!

[@shivanshudabral3210]

very nice teacher i found

[@prashujain4844]

best explaination

[@raghavendraraviteja1055]

Good explanation, thank you

[@poonam.m.]

Excellent explaination sir!

[@rohithbharathi3664]

thank you for the detailed explanation

[@vishalrikhi4297]

thank you for the explanation!

[@KNT_19]

Here also we are using two loops. So I think this also n*n time complexity algo.

[@krishnodas6678]

Yes but those two are nested it becomes n*n only when it is nested, but here it has n +n = 2*n comparison bro , and O(2n) is O(n) , but in case of nested loops for each iteration of outer loop inner loop is running n+n++n ......n times i.e. n² comparison

[@Ahadi237]

Please explain Cage- amalgamation graph, how we cane find it? thanks

[@hardikachordia2269]

Hi Can you please provide optimize solution if we have internal table of positive and negative integers with at least one positive integer, get the maximum possible positive sum

[@devanshprakash8354]

Can u please upload code videos on bfs,dfs, prims algo, kruskal algo etc etc also ☺️

[@viveksharma1931]

Here time complexity is O(2n) or O(2^n) which is exponential hence for larger input size it is not approx equals to O(n)

[@gamingsparrow2990]

Sir please take class about hypergraph

[@saranvasanth2403]

if the matrix is not balanced then how can I print it

[@banutejagoud7928]

It is wrong at the step rightsum=sum=0; becuase you have updated the sum in the above steps by using for loop . Then how the rightsum will be equal to zero at first?

[@Sksahu_123]

Sir please upload more + code link

[@amanahmed6057]

sir what if there is no equilibirum element

[@shivanshudabral3210]

plz upload all topics

[@krishnashejul6418]

int equilibriumPoint(long long a[], int n) { // Your code here int left[n]; left[0]=0; for(int i=1;i=0;i--){ right[i]=right[i+1]+a[i+1]; } int result; for(int i=0;i

[@vivekmishra5876]

U must have explained the logic/mathematics behind the for loop

[@ordered_saddle5]

also index 4 can be answer