#Combinations of String Given a string, finding all the possible subsets of the String
#Merge sort It's a sorting technique which uses the principle of divide and conquer using recursion.
#Searching Matrix searching an element in matrix which is sorted row wise and coloumn wise and return 1 if its present else return 0
#Binary Tree to Doubly Linked List Given a binary tree convert it into doubly linked list without using extra space
#Permutations of a String Finding all the permutations of a String
- Permutations lexicographically
- Permutations without any order