Find Pivot Index (LeetCode 724) | Full solution with constant space | Very important

preview_player
Показать описание


Chapters:
00:00 - Intro
00:45 - Problem Statement
03:11 - Brute Force Solution
05:14 - A constant space solution
09:47 - Dry-run of Code12:32 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
Рекомендации по теме
Комментарии
Автор

Your approach is amazing. I always look up to your videos to fully understand the problem and try to solve it on my own first. Can you put up some videos on Priority Queue?

Chandralekhachilumula
Автор

The same q was asked to me in Cimpress interview round, 3 days back😁😁

beinginnit
Автор

Its a nice solution, I used the stream API to sum the elements on the right in this way int rightSum = Arrays.stream(nums).sum()
but it was not performing and when i changed to the normal for loop, it was performing well. I do not know why it was like that.

kchemutai
Автор

Sir when will system design video come❓

tecboost