Given an array of integers, this problem looks for the longest increasing subsequence within that array. An example input would be [10,9,2,5,3,7,101 ,18] and the output in this case would be 4.

214

Nov 18
Given an array of integers, this algorithm will find the length of the longest increasing subsequence. For example, given the input array [10, 22, 9, 33, 21, 50 , 41, 60], the output would be 6.

225

Nov 18
This problem asks us to find the largest subset of integers in an array whose sum is less than or equal to a given integer k. For example, if n = 5 and k = 12 , and our array is arr = [2, 3, 5, 7, 9], then the largest subset of integers that sum to 12 or less is {2, 3, 7}, which has a sum of 12.

204

Nov 18