Welcome to Joey’s dynamic programming tutorial.

This video brings for you a DP problem that will help you the most if you are a beginner.
Probably, it is one of the best problems to begin learning the dynamic programming technique.

And in case you are already at an intermediate level or an advanced level, then with this problem, you are about to rediscover the joy of the time when you started learning dynamic programming.

The problem we are going to focus on in this video is ‘Maximum Subarray’

A subarray is the subset of an array and is different from a subsequence in a way that a subarray consists of contiguous elements from the array.

We will dive into the problem statement now so let’s check it out.

You are given the following integer array. Note that this array is a mixture of positive and negative integers.

You need to find out the contiguous subarray which gives you the largest sum. In addition to the subarray, you need to give the largest sum.

I am going to explain the solution to you in a moment but before that I want you to hit the subscribe button and the bell icon next to it as that impacts my ability to create videos for you in a direct manner.

[ Ссылка ]

свернуть