Given an array of integers, this problem looks for the longest increasing subsequence within that array.

194

Mar 10
Given an array of integers and a target sum, return the indices of the two numbers that add up to the target sum.

167

Mar 09
Given an array of n integers, the problem is to find the contiguous subarray of length k with the maximum sum.

167

Mar 09
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.

181

Mar 09
To find the minimum value in an array of integers, we can simply compare each value in the array to the others and keep track of the smallest value we've seen so far.

182

Mar 08
Given an array of integers, this problem seeks to find the largest sum of consecutive integers in the array. For example, in the array [2, 3, -5, 7, 8 ], the largest sum of consecutive integers is 15 (2 + 3 + 7 + 8).

172

Mar 08
This problem is about finding the longest increasing subsequence in an array of integers.

172

Mar 07