Longest Alternating Subarray | Dynamic programming for coding interviews смотреть онлайн

Longest alternating sub array is what we are going to look into in this video of Joey’s dynamic programming tutorial.

You can’t afford to miss this video if you are a beginner in dynamic programming because DP problems like these are going to take you to the next level.

I am linking other basic dynamic programming problems with this video for you to watch.

So, if you watch these videos and follow along with me then you are doing a lot to develop your skills in solving computing problems.

I suggest that you do the problem once with me with a notepad and a pen, after which you try it yourself in the next two days.

This strategy is going to do wonders for you and it’s very simple to implement.

Speaking of finding the longest alternating sub array using dynamic programming you would ask what is an alternating subarray?

An alternating sub-array is a consecutive set of integers in which every two consecutive integers hace opposite times.

For example, consider this array

{ -4, 5, -8, 5, 7, -2, 1, -4 }

The longest alternating sub array from this array will be { 7, -2, 1, -4 }

You can see that any two consecutive integers you pick from here will have opposite signs.

Note that you have to find the subarray, not the subsequence. A subarray is a set of consecutive integers from the main array.

So, let’s solve this DP problem together in this video of Joey’sTech.