Find Pivot Index | Leetcode 724 Solution | Searching and Sorting

[aakashgoswami]

Didi 's way of teaching is op.Thankyou pepcoding.

[shang_chi]

Fantastic explanation 👍thanks a lot mam🙏

[RajuSingh-rmyx]

Thank you so much really it's helpful for us.

[madlegends]

Thanks didi . the way of explanation just awesome.

[paulbarsha]

why my code saying wrong answer?

class Solution {
public:
int pivotIndex(vector<int>& nums) {

int size=nums.size();
int Left=0;
int Right=0;

for(int i=0; i<size;i++)
{
Right+=nums[i];
}

for(int i=0; i<size; i++)
{

Right=Right-nums[i];

if(left==right)
return i;

Left+=nums[i];
}

return -1;
}
};

[abhilash]

That was clean and precise
thank you

[hahahaha]

can we write the if condition after calculating the updated value of lsum and rsum?

[nageshwankhade]

An explanation is great but kindly discuss TC & SC of each problem.

[varunsinghal]

can pivot index be first and last index of array??
like a[0], a[n-1]?

[adil]

Explanation was really good.but TC and SC not mentioned... only optimal approach discussed