Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.

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 array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

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

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

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

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

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).

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