Longest Increasing Subsequence Explained | Bottom Up Dynamic Programming | Java

In this video we are looking at another example of Top Down Dynamic Programming question by solving: the Longest Increasing Subsequence.

In the problem we are given an array of integers and we want to find the length of the longest sequence of numbers. The twist here is that we can choose to skip any number we want in the sequence!

If you're interested in more Top Down DP problem, check out our video talking about Climbing Stairs: https://youtu.be/aquoXtYMUME

00:00: Longest Increasing Subsequence Introduction
00:14: Understanding Longest Increasing Subsequence
00:52: Visualizing All Possibilities
02:06: Walking Through an Example Problem
07:42: Runtime and Space Time Analyis
08:28: Live Code

Видео Longest Increasing Subsequence Explained | Bottom Up Dynamic Programming | Java канала Josh's DevBox