Create Longest Increasing Subsequence - Leetcode 300.py

Author: gahogg

Longest Increasing Subsequence - Leetcode 300.py

@@ -0,0 +1,15 @@
+class Solution:
+    def lengthOfLIS(self, nums: List[int]) -> int:
+        # Bottom Up DP (Tabulation)
+        # Time: O(n^2)
+        # Space: O(n)
+        
+        n = len(nums)
+        dp = [1] * n
+
+        for i in range(1, n):
+            for j in range(i):
+                if nums[i] > nums[j]:
+                    dp[i] = max(dp[i], dp[j] + 1)
+
+        return max(dp)