Simple 1D DP SOUTION beats 90%!!!!!!
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int lengthOfLongestSubsequence(vector<int>& nums, int tar) {\n           vector<int> dp(tar+1,-1);\n            dp[0]=0;\n        for(auto it:nums) {\n            for (int i=tar;i>=it;i--) {\n                if (dp[i-it]!=-1) {\n                    dp[i]=max(dp[i],dp[i-it]+1);\n                }\n            }\n        }\n        return dp[tar];\n    }\n};\n```
['Dynamic Programming', 'C++']