LeetCode 300: Longest Increasing Subsequence

[github-actions]

LeetCode 300: Longest Increasing Subsequence

Category: Dynamic Programming
Difficulty: See LeetCode
Solution File: src/dynamic_programming/longest_increasing_subsequence.py
Test File: tests/test_longest_increasing_subsequence.py

Problem Description

Given an integer array nums, return the length of the longest strictly increasing subsequence.

Example 1:
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4.

Example 2:
Input: nums = [0,1,0,3,2,3]
Output: 4

Constraints:

• 1 <= nums.length <= 2500
• -10^4 <= nums[i] <= 10^4

Tasks

• Implement the solution in src/dynamic_programming/longest_increasing_subsequence.py
• Ensure all test cases pass
• Analyze time complexity
• Analyze space complexity