1) Most Efficient Binary search
2) User Defined Malloc
3) Loop Detection and loop break in Link List
4) Implement Queue Using Stack
5) Reverse Each K element in Link List
6) Print 2D Array in Spiral Form
7) Print Link List Reversly without Reversing the Link List
8) Check Whether a Link List is palindrom or not(most efficient method)
9) Add two link list (don't merge the link list , value should be added)
10) Find Lowest Common Ancestor in Binary Tree
11) Find Union of 2 Unsorted Link List
12) Merge Two Tree
13) Merge Two Binary Search Tree