Max Contiguous Subarray Sum

Table of Contents:

The Problem Introduction 0:00 - 0:31
What I Think Immediately 0:31 - 0:55
What Is A Contiguous Subarray 1:00 - 1:52
Jumping To The Brute Force Quickly 1:52 - 2:34
Search Contig. All Subarrays: Birth of Brute Force 2:34 - 3:01
Cubic Time Approach 3:01 - 4:30
Cubic and Quadratic Solutions Search All Windows 4:30 - 4:35
Why The Cubic Solution Is Slower 4:35 - 5:34
Bottlenecks, Unnecessary Work, Duplicate Work 5:34 - 6:04
How To Compute Subarray Sums Better 6:04 - 7:32
Can We Improve To Linear Time? 7:32 - 7:54
Establishing The Fundamental Subproblems 7:54 - 10:32
Establishing Our Fundamental Choice 10:32 - 13:23
Walking Through The Dynamic Programming Table 13:23 - 17:54
We Are Done Filling The Table Out 17:54 - 18:14
The Best Answer To Our Question 18:14 - 18:30
This Does Not Need To Sink In At Once 18:30 - 18:46
Time & Space Complexity 18:46 - 18:58
Wrap Up 18:58 - 19:18

Code: https://github.com/bephrem1/backtobackswe/blob/master/Dynamic%20Programming%2C%20Recursion%2C%20%26%20Backtracking/MaxContiguousSubarraySum/MaxContiguousSubarraySum.java
Leetcode Link: https://leetcode.com/problems/maximum-subarray

Discussion

0 comments