Maximum sum Subarray | Dynamic Programming | GeeksforGeeks

Our courses :

This video is contributed by Akshit Ostwal.

Please Like, Comment and Share the Video among your friends.

Install our Android App:

If you wish, translate into the local language and help us reach millions of other geeks:

Follow us on Facebook:

And Twitter:

Also, Subscribe if you haven't already! :)
#competitiveprogramming

[indraneels]

Given an array A of integers, return the length of the longest arithmetic subsequence in A.

Recall that a subsequence of A is a list A[i_1], A[i_2], ..., A[i_k] with 0 <= i_1 < i_2 < ... < i_k <= A.length - 1, and that a sequence B is arithmetic if B[i+1] - B[i] are all the same value (for 0 <= i < B.length - 1).



Example 1:

Input: [3, 6, 9, 12]
Output: 4
Explanation:
The whole array is an arithmetic sequence with steps of length = 3.
Example 2:

Input: [9, 4, 7, 2, 10]
Output: 3
Explanation:
The longest arithmetic subsequence is [4, 7, 10].
Example 3:

Input: [20, 1, 15, 3, 10, 5, 8]
Output: 4
Explanation:
The longest arithmetic subsequence is [20, 15, 10, 5].

[nocode]

Please reduce price for CP course.. Please

[soumyadeepmitra]

Thanks gfg....i am also enrolling myself in your DSA selfpaced course.

[damanjotkaur]

hey Akshit! why did you stop posting more such videos on this topic? we are waiting for your videos because they really give us a new perspective of looking at a problem statement!! hoping for you to continue this series!!

[faisalsal]

Very poor choice of an example where the answer is the sum of all the items of the array.

[Debugerr]

next time try a good question on graph or tree

[kunalsoni]

This is really very best tutorials on kadane algo.. for maximum sum sub array 😇😇☺️
Thanks geeksforgeeks

[mcbotface]

Bro, would the Java code be more efficient if you would use arr.length instead of passing n from the main method ?

[praveenchouhan]

Bad explanation!!! You did not explain the idea behind the kadane algo which is the core part