9.md

Longest Increasing Subsequence

int lengthOfLIS(vector<int>& nums) {
        
        if(nums.empty())
            return 0;

        int n=nums.size();
        vector<int>dp(n,1);

        for(int i=1;i<n;i++)
        {
            for(int j=0;j<i;j++)
                if(nums[i]>nums[j])
                    dp[i]=max(dp[i],dp[j]+1);
        }

        return *max_element(dp.begin(),dp.end());
    }