## Algorithms

##### Maximum sum subarray of length k in array of n integers

Find the contiguous subarray of length k with the maximum sum in an array of n integers.

195
Feb 27
##### longest consecutive sequence

This problem asks you to find the length of the longest consecutive sequence in an array of integers. Your algorithm should run in O(n) time and use only constant space.

191
Feb 27
##### Squares of an Array

This technical problem deals with taking an array of integers and returning an array of the squares of those integers. So, for example, if the input array is [-1, 2, 3, 4, 5], the output array would be [1, 4, 9, 16, 25].

199
Feb 26
##### Find the maximum average value in a contiguous subarray of length k.

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.

189
Feb 26
##### Two Sum

The problem is to find the indices of two numbers in an array that sum up to a given target. There is always a solution, and you cannot use the same element twice.

220
Feb 26
##### Product of All Array Elements Except the One at Index i

Given an array of integers, return a new array such that each element at index i of the new array is the product of all the numbers in the original array except the one at i.

201
Feb 26
##### Sum of Positive Integers in Array

The function should take in an array of positive integers and return the sum of all the integers in the array.

199
Feb 26
##### Longest consecutive element sequence

Given an unsorted array of integers, this algorithm will find the length of the longest consecutive element sequence. For example, given [100, 4, 200, 1, 3, 2], the longest consecutive element sequence is [1, 2, 3, 4]. The algorithm will return the length of this sequence, which is 4. The algorithm runs in O(n) complexity.

206
Feb 26