Rust: Max Subarray Problem

In this video we go over the Max Subarray Problem. In doing so, we cover Big O notation, the difference between Divide and Conquer and Dynamic Programming, we go over the three different solutions to the problem in Rust, and we benchmark the solutions with inputs of various lengths.

Timestamps 00:00 Intro 00:47 Define the problem 04:53 Solution types 08:49 History of problem 11:04 Big O 16:27 History part 2 23:09 Rust solutions 25:55 Brute Force 32:03 Divide & Conquer 45:38 Kadane 54:15 Tests 59:49 Benchmark tests

Links:

• Max Subarray Problem Wiki: https://en.wikipedia.org/wiki/Maximum_subarray_problem
• Dynamic Programming Wiki: https://en.wikipedia.org/wiki/Dynamic_programming
• Big O Notation Wiki: https://en.wikipedia.org/wiki/Big_O_notation
• Big O chart: http://i0.wp.com/www.jessicayung.com/wp-content/uploads/2016/08/screenshot-5.png?fit=846%2C591
• Github Page with code: https://github.com/crazcalm/rust_leet_code/blob/main/src/maximum_subarray.rs

My Social Links:

• Twitter: https://twitter.com/Crazcalm
• IG: https://www.instagram.com/crazcalm.tech.stack/ ... https://www.youtube.com/watch?v=ZCVvFOPRj2k