Скачать или смотреть Doing a coding challenge LIVE: Find Pivot Index!

Join me to work through a coding challenge LIVE from Leetcode.com called Find Pivot Index!

Problem:
“Given an array of integers nums, calculate the pivot index of this array.”

Solution summary:
— I needed a hint here. It was that the sum to the right of any given index is = Total sum - Current index value - Left side sum.
— So I pre-compute the total sum of the array.
— Then loop the array, updating the left sum each interval, also checking if the right sum matches using the formula above.
— Time complexity: where 'N' is the length of the array, I perform N operations with the initial loop, then another N operations for each item to calculate/check sums.
N + N = 2N = O(n)

Let me know if you have any questions or see ways I could have optimized!

Bonus: at the end of the video I answer questions.

Let's connect!
🌐 Website | https://www.kg.codes
📺 Subscribe |    / @kgcodes  
📷 Instagram | www.instagram.com/kg.codes/
🎵 TikTok | https://www.tiktok.com/t/ZTRLxP4wf/
🐦 Twitter | www.twitter.com/kgcodes/

Get my coding gear / desk setup 👨🏾‍💻
📦 Amazon | https://www.amazon.com/shop/kg.codes/...