Given an array of integers, this problem aims to find the length of the longest increasing subsequence in the array. For example, given the input array [10, 9, 2, 5 , 3, 7, 101, 18], the output should be 4, as the longest increasing subsequence in the array is [2, 3, 7, 101]. This problem can be solved using dynamic programming, and the time complexity of the solution is O(n^2).

232

Dec 05
Given an array of integers, this problem asks to find the length of the longest increasing subsequence within that array. An example input is provided, along with the expected output.

229

Dec 04
Given an array of n integers, find the contiguous subarray of given length k that has the maximum average value. Output the maximum average value.

207

Dec 04
Given an array of n integers, find the contiguous subarray of given length k that has the maximum average value. Output the maximum average value.

205

Dec 03
Given an unsorted array, this algorithm finds the length of the longest consecutive elements sequence.

222

Dec 02
Given an array of integers, this algorithm finds the length of the longest increasing subsequence in the array.

213

Dec 01
Given an array of integers, find the first missing positive integer in linear time and constant space.

199

Nov 28