Project 1

1.EQUILIBRIUM POINT

2.LEADERS IN AN ARRAY

3.REVERSE WORDS IN A GIVEN STRING

4.REMOVE DUPLICATES

5.FINDING MIDDLE ELEMENT IN A LINKED LIST

6.REVERSE A LINKED LIST

7.PAIRWISE SWAP ELEMENTS OF A LINKED LIST

8.ADD TWO NUMBERS REPRESENTED BY LINKED LISTS

9.BINARY TREE TO DLL

10.BELLMAN FORD ALGORITHM

11.MINIMUM SWAPS TO SORT

12.GET MINIMUM ELEMENT FROM STACK