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

# Author: Raunak Jain

SDE at Societe Generale | Ex-Intern at Samsung R&D Institute | Ex-Intern at Hewlett Packard Enterprises

## Count of leaf nodes

You are given a non-empty binary tree. You need to find out the number of leaf nodes present in the tree. Leaf nodes are those

## 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

## Symmetric Tree (Mirror image of itself)

You are given a binary tree, check whether it is symmetric or not. A symmetric tree is one if it is a mirror image of

## K’th smallest element in unordered list

You are given an unordered list of integers, you need to find the K’th smallest integer in that list. Sample Input: Arr = { 7,

## Permutations of a string using backtracking.

Given an array or a string, print all the permutations of it. A permutation of a string, is a rearrangement of the elements of the