1. Get all permuatations of a string using recursion
   
2. Fibonnaci calculation recursion
   
3. Get all possible subsets of a set using binary number shifting
   
4. Sort a array with only 0's and 1's in O(n) time
   
5. Sort a array with only 0's, 1's and 2's in O(n) time
   
6. Implement a paint fill feature as used in paint applications
   
7. Parenthesis Permutation Problem
   
8. String Number Permutation problem
   
9. Impelementation to get longest subarray of distinct characters
   
10. Implementation to get maximum sum of increasing subsequence
    
11. Implementation to reverse a binary number
    
12. Implementation to retrieve next greatest element in a array
    
13. String tokenizer on basis of space with exception of quotes