## FIxed Size Array

Introduce fixed size array

Introduce fixed size array

A dynamically resizing array is an array that resizes itself as needed

Rotate an array of n elements to the right by k steps.

Given a non-negative number represented as an array of digits, plus one to the number.

Given an array S of n integers, find there elements a, b, c in S such that a + b + c = 0.

Given an array S of n integers, find three integers in S such that the sum is closest to a given number.

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

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Given numRows, generate the first numRows of Pascal's triangle.

Given an index k, return the kth row of the Pascal's triangle.

Given a set of distinct integers, nums, return all possible subsets.

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used.

Write an efficient algorithm that searches for a value in an m x n matrix.

Write an efficient algorithm that searches for a value in an m x n matrix.

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.

Given a sorted integer array without duplicates, return the summary of its ranges.

Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of [...]

Convert a string to the ZigZag pattern

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.

Find two vertical lines which form a container with x-axis , such that the container contains the most water.

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.

Given an array for which the ith element is the price of a given stock on day i, design an algorithm to find the maximum profit if you were only permitted to complete at most one transaction.

Given an array for which the ith element is the price of a given stock on day i, design an algorithm to find the maximum profit if you may complete as many transactions as you like.