You are given an integer array, sorted in ascending order and a target integer. Suppose that the array is rotated at some pivot point that

# Tag: sorting

## Sorted Array to BST

You are given an array which is sorted in increasing order, you need to convert that array into a Binary Search Tree. Note that the

## Minimum unsorted subarray.

You are given an unsorted array, you need to find the minimum length of subarray sorting which the whole array becomes sorted. Return the starting

## Sort an array of 0’s, 1’s and 2’s

You are given an array whose elements are only 0’s, 1’s and 2’s. You need to sort the array in increasing order in linear time