Day-15 q3 : Longest Increasing Subsequence

[GargNikitaa]

Longest Increasing Subsequence

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

Examples:

Input: nums = [10,9,2,5,3,7,101,18]
Output: 4

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

Input: nums = [7,7,7,7,7,7,7]
Output: 1

[vidhiwalia]

please assign this issue to me @ayushichoudhary-19 @GargNikitaa

[Akansha77]

Please assign this issue to me.

[namita0210]

Pls assign this issue @bh-g

[priyagupta20044]

Pls assign this issue @bh-g

[Karnankita04]

@bh-g please assign this issue to me :)