Maximum sum contiguous sub-array
Find a contiguous sub-array whose sum is maximum. Using the dynamic programming based Kadane’s Algorithm, we can solve this in O(N) time.
Tag: Dynamic Programming
Dynamic Programming – Edit Distance
Hello people..! In this post, we will see another dynamic programming based problem, finding the minimum edit distance between two strings. Problem […]
Dynamic Programming – Kadane’s Algorithm
Hello people..! In this post, we will look at a simple dynamic programming based algorithm which is the optimal solution to the […]
Dynamic Programming – Introduction and Fibonacci Numbers
Note – Theory of Coding is also on YouTube! This post has a video. Watch it at – https://youtu.be/rOjPwES9R2k Hoping you’ll support […]