# Maximum Subarray – LeetCode 53

## Problem

### Description

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

Posted on

Posted on

The count-and-say sequence is the sequence of integers with the first five terms as following:

- 1
- 11
- 21
- 1211
- 111221

1 is read off as “one 1” or 11.

11 is read off as “two 1s” or 21.

21 is read off as “one 2, then one 1” or 1211.

Given an integer n, generate the nth term of the count-and-say sequence.

Note: Each term of the sequence of integers will be represented as a string.

Posted on

Posted on

Posted on

Given an array and a value, remove all instances of that value in place and return the new length.

Do not allocate extra space for another array, you must do this in place with constant memory.

The order of elements can be changed. It doesn’t matter what you leave beyond the new length.

Posted on

Posted on

Posted on

Posted on

Posted on