LeetCode Find Pivot Index Solution Explained - Java
Vložit
- čas přidán 9. 07. 2024
- The Best Place To Learn Anything Coding Related - bit.ly/3MFZLIZ
Preparing For Your Coding Interviews? Use These Resources
--------------------
(My Course) Data Structures & Algorithms for Coding Interviews - thedailybyte.dev/courses/nick
AlgoCademy - algocademy.com/?referral=nick...
Daily Coding Interview Questions - bit.ly/3xw1Sqz
10% Off Of The Best Web Hosting! - hostinger.com/nickwhite
Follow My Twitter - / nicholaswwhite
Follow My Instagram - / nickwwhite
Other Social Media
----------------------------------------------
Discord - / discord
Twitch - / nickwhitettv
TikTok - / nickwhitetiktok
LinkedIn - / nicholas-w-white
Show Support
------------------------------------------------------------------------------
Patreon - / nick_white
PayPal - paypal.me/nickwwhite?locale.x...
Become A Member - / @nickwhite
#coding #programming #softwareengineering - Věda a technologie
This logic also works fine
int sum=0;
for(int i=0;i
that line " iam the king of mistakes"🤣🤣🤣🤣
Love the fact that it was actually a long explanation cause you did a great job at teaching the example at hand.
if anyone listen you carefully ,then easily understand...really very good explanation...
bro try to upload more video(leetcode) as much as possible...
Nice explanation! However, in the code, shouldn't line 10 be nums [i - 1] instead of nums [i]? Prefix sum is sum of all elem to left of current elem (at i). That is also the reason we check for i != 0, since there is nothing to left of 0, so we cannot do nums [0 - 1] and so we assume prefix sum = 0 in that case.
depends on the requirements and constraints. Here it considers everything left from nums[0] as 0, as well as everything right from nums[nums.length - 1]
No dude , no mess at all thanks if the video is still longer bt you conveyed it nicely to people.
Thanks dude, you explained very well
You are amazing leetcoder nick.
Thank you so much and for also showing your mistakes, it helps us understand better
Yo Man - You are doing great and one of the best leetCoder
I love your way of teaching Nick Love from India💙
6:56 we respect your efforts !! love you bro !! we respect you
it's more like a stand up dude ! 😂
but worth it
You are the best leetcoder ever...your solutions are amazing with really good explanation!
I never make mistakes, which is why watch your videos.... Just kiddin' great explanation. Thanks.
you are my ideal person !!!
Your explanations are the best and I love you bruh (much better than neetcode), but coming directly to the total sum may be not so intuitive, was not for me. I first solved it with left to right and right to left loops.
Then to remove the extra space, I came up with the total sum.
I wasted 3 hrs in this problem. Trying to solve this
You are the best😍😌
thnx,
🔥🔥🔥
04:10 my boy is high for sure lmao
Luke Skywalker