Given a non-empty array of integers, every element appears twice except for one. Find that single one.

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appea...

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

Given an unsorted array of integers, find the length of longest increasing subsequence.

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the so...

Given a non-empty array of integers, return the k most frequent elements.