Maximum Subarray - LeetCode 53 - Java | Kadane's Algorithm

preview_player
Показать описание
In this video I will show you the Ultimate guide to solve Maximum Subarray question, but not only that, but I will also show you how to reduce the time complexity from O(n^3) to O(n^2) to O(n) using Kadane's Algorithm.

Video contents:

00:00 - Read and understand the question
01:59 - O(n^3) approach explained
05:44 - O(n^2) approach explained
07:12 - O(n) approach explained - Kadane's algorithm
15:24 - Code the solution
17:48 - Time and Space complexity
Рекомендации по теме
Комментарии
Автор

Keep doing these! You are in my list of the top 3 people who teach very well about a problem (mostly leetcode problems). You go in depth and give detailed explanations whether we understand it or not ❤

SupremeChief
Автор

Great explanation makes easier to understand any hard problem. Thanks for the great problem solving videos

chmbinil