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.

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them...

Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]….

Given an array of integers with possible duplicates, randomly output the index of a given target number. You can assume that the given target number must exist ...

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

Two elements of a binary search tree (BST) are swapped by mistake.

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

Unique Paths IIDesicriptionFollow up for “Unique Paths”:Now consider if some obstacles are added

Given an unsorted integer array, find the first missing positive integer.