## Arrays And Lists

##### Finding the Longest Increasing Subsequence in an Array

The problem is to find the length of the longest increasing subsequence in an array. For example, given the array [10, 22, 9, 33, 21, 50, 41, 60, 80], the longest increasing subsequence would be of length 6, and would be [10, 22, 33, 50, 60, 80].

198
Nov 25
##### Sum of elements in a list of integers

This technical problem deals with finding the sum of all the elements in a list of integers. An example input would be [1, 2, 3, 4, 5], and the corresponding output would be 15.

177
Nov 25
##### Sum of elements in a list

To find the sum of the elements in a list of integers, simply iterate through the list and add each element to a total.

143
Nov 21
##### Maximum Sum of a Contiguous Subarray in an Array of Integers

Given an array of integers, find the maximum sum of a contiguous subarray. For example, given the array [-2, 1, -3, 4, -1, 2, 1 , -5, 4], the maximum sum of a contiguous subarray is 6 (the sum of the subarray [4, -1, 2, 1]).

190
Nov 20
##### Sum of all odd integers in an array

This problem asks you to return the sum of all the odd integers in an array. For example, if the input array is [1, 2, 3, 4, 5], the output should be 9.

113
Nov 19
##### "Largest sum of non-adjacent numbers in a list of integers"

Given a list of integers, the largest sum of non-adjacent numbers can be found by writing a function. The function will take the list as input and return the largest sum possible.

180
Nov 19
##### Sum of integers in array

To find the sum of integers in an array, simply iterate through the array and add each integer to a total sum.

207
Nov 18
##### Adjacent Integer Sums in Python

This problem asks the programmer to write a function that returns the largest sum that can be generated by adding together any two adjacent integers in a given list. An example input and output is given.

174
Nov 12