C++ DP
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int lengthOfLongestSubsequence(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());
        vector<int> dp(target+1, -1);
        dp[0] = 0;
        for(auto x : nums){
            if(x <= target){
                for(int i = target ; i >= x ; i--){
                    if(dp[i - x] != -1)
                        dp[i] = max(dp[i],dp[i - x] + 1);
                }
            }
        }
        return dp[target];

    }
};
```
['C++']