LeetCode Challenge Day 4 - First Good Problem?

Subscribe for more educational videos on algorithms, coding interviews and competitive programming.

#Coding #Programming

[AshishKumar-jjyw]

One suggestion Kamil. As these problems seem incredibly standard as far as coding interviews are concerned, maybe after solving the problem, you can challenge us with some variant that you can construct.

[ronaldabellano]

You’re really good at explaining better than AlgoExpert

[KrishNa-hmmk]

8:26. Totally what I needed to hear. I was feeling low for not able to think of a solution for Max subarray. Never knew Kadane's algorithm existed. But since you said this I feel that I need to discover more topics and learn as and when a new topic arises. Cheers 🙌

[AlokKumar-jhwp]

Thankyou Errichto. The way you explain is incredible. You should launch your own course on data structures and algorithms. I remember the most valuable statement which was told in previous videos: - “Thinking is more important in programming”. These are golden lines

[dragonore]

I'm terrible at algorithms, I'm glad the company I work for didn't ask tough questions and I"m still employed with them, doing great things.

[pratiyushprakash]

I started Leetcode for fun because of lock-down. And now I am enjoying it. Thanks bro :) Subscribed.

[Philgob]

this guy’s code is clean asf and his explanation are the best i’ve seen for these

[_GabrielNexT]

The quality gets better with each video. Congratulations bro!

[arthurg]

Please make Code Jam 2020 solutions video especially the 3rd, 4th and 5th question.
Also your explanation is really awesome. Not too difficult to understand nor fells like too much spoon feeding just perfect. This channel feels like my 1 stop to all my competitive programming needs.

[Kumarsivam]

Your explanation is by far the most suitable explanation, not only in this video but every video you have ever uploaded. Also, I am no expert in coding but this algoexpert advertisement is creeping in every coding youtube channel I search nowadays.

[Francisco-ziqg]

I couldn't agreed more on your final thought, that's why so many people gets frustrated when starting competitive programming. If myself of fifteen years ago have seen this video it would had been much easier, well by that time there weren't YouTubers. Excellent work and thanks.

[chai]

Loving this series! Will we see a Code jam Quals video soon? Would love to hear your explanation of those last two problems! Keep up the great work!

[vijay]

The category of this video is Education. Now legend is not playing sports but become the coach. btw love your videos.

[jimwoodward]

These videos are great -- your explanations are so straight forward and logical.

[jay-rathod-]

Well I felt todays problem was easier than the previous one's.

[cactusbee]

Great! You have amazing talent to explain solution. Not everyone has that talent. Good luck!

[stonecoldcold]

Love this serie bro! I want to see you uploading for all 30 daus

[siddharthpanigrahi]

if you use index, then you can swap nums[next] and nums[i]. you wont have to put zeros in end.

[mayukhchanda]

Thank you for making these videos. I am taking this challenge and so far your videos have helped me a lot to understand and learn better ways to solve problems. Please keep up this series.🙏🙏 Really appreciate the videos

[stefanogagliardi]

Very good from Italy. Last for cycle to get difference of size (so add n 0 to the end) is very ingenious. Best regards!