Easy Level

1. Binary Search
2. Check if a number is Palindrome
3. Heap Sort
4. Merge Sort
5. Print the string after the specified character has occurred given no. of times
6. Program for Armstrong Numbers
7. Queue | Set 2 (Linked List Implementation)
8. Write one line C function to find whether a no is power of two
9. Check for balanced parentheses in an expression
10. Diameter of a Binary Tree
11. Dynamic Programming | Set 10 ( 0-1 Knapsack Problem)
12. Find the first repeating element in an array of integers
13. Find minimum number of coins that make a given value
14. Find profession in a special family
15. Implement Stack using Queues
16. Merge two sorted linked lists
17. Print a given matrix in spiral form
18. Print all Jumping Numbers smaller than or equal to a given value
19. Implement Queue using Stacks
20. Remove duplicates from a sorted linked list
21. Root to leaf path sum equal to a given number
22. Search in a row wise and column wise sorted matrix
23. Searching for Patterns | Set 2 (KMP Algorithm)
24. Stock Buy Sell to Maximize Profit

Medium Level

1. Connect nodes at same level
2. Program to convert a given number to words
3. Detect and Remove Loop in a Linked List
4. Detect Cycle in a Directed Graph
5. Detect cycle in an undirected graph
6. Dynamic Programming | Set 11 (Egg Dropping Puzzle)
7. Largest Sum Contiguous Subarray

Hard Level

1. AVL Tree | Set 1 (Insertion)
2. AVL Tree | Set 2 (Deletion)
3. Backtracking | Set 7 (Sudoku)
4. Median in a stream of integers (running integers)