[Code Addition Request]: Longest Increasing Subsequence | Dynamic Programming

[SKG24]

Have you completed your first issue?

• I have completed my first issue

Guidelines

• I have read the guidelines
• I have the link to my latest merged PR

Latest Merged PR Link

#910
PR #910

Project 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.

Full Name

Sanat Kumar Gupta

Participant Role

gssoc-ext, hacktoberfest

[github-actions]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[UTSAVS26]

@SKG24 raise 1 issue at a time.

[github-actions]

✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!