1. Convert BST to DLL
2. Implement Ring buffer with fixed size array
3. In a given array, move all even numbers to left and odd numbers to right without using an extra array
4. Print triplets of an array who sum is equal to zero with out repeating numbers. Array can consist of both positive and negative numbers
