Maximum Sum Subarray Problem - Dynamic Programming

Опубликовано: 05 Декабрь 2024
на канале: Code on Mars
99
1

This video is a quick explanation on kadane's algorithm.

It is also known as the Maximum sum subarray problem, which is a very common question in a coding interview, and this gives the optimal answer.

"Maximum subarray problem"
"Kadane's Algorithm"


📖 Suggested books
Introduction to Algorithms - https://amzn.to/3IdqpHu
Data Structures And Algorithms Made Easy: Data Structures - https://amzn.to/3vuqVJE
SPEAKING JAVASCRIPT AN IN-DEPTH GUIDE FOR PROGRAMMERS - https://amzn.to/3i149FU
Cracking the Coding Interview - https://amzn.to/3jJnzjm
DESIGNING DATA-INTENSIVE APPLICATIONS - https://amzn.to/3GqD4Wa
Atomic Habits: The life-changing million-copy bestseller - https://amzn.to/3IcETHm
System Design Interview - An insider's guide - https://amzn.to/3jDZtqa
DEEP WORK: RULES FOR FOCUSED SUCCESS IN A DISTRACTED WORLD - https://amzn.to/3GrumHg