| Algorithms | |||
| Easy | Medium | Difficult | |
| 2020 | 1. Merge sort 2. Masters Theorem | 1. Time complexity 2. Huffman Coding 3. Insertion sort 4. Hashing 5. Matrix chain multiplication | — |
| 2018 | 1.Dynamic Programming 2.Sorting(2) 3.Transitive Closure | 1.time complexity 2.Code segment 3.Hashing(2) 4.Recurrence relation | — |
| 2017(Dec) | 1.Recurrence relation 2.Sorting | 1.Iterative program complexity 2.Mis 3.Sorting 4.Hashing 5.Heap | — |
| 2017(May) | 1.NP Complete 2.Sorting(2) 3.DP 4.Transitive closure | 1.NP Complete | — |
| 2016 | 1.Sorting | 1.Hashing 2.Recurrence relation | — |
| 2015 | 1.MST | 1.sorting(2) 2.Greedy Algorithms 3.Hashing 4.Recurrence relation | — |
| 2014 | 1.Sorting | 1.Recurrences | — |
| 2013 | 1.Sorting | 1.Hashing | — |
| 2011 | 1.Sorting(2) | 1.Recurrence Relation | — |
| 2009 | — | 1.Polynomials | — |
| 2008 | 1.Shortest path | 1.Sorting Techniques | — |
| 2007 | 1.Sorting(2) 2.Fibonacci series | — | 1.Job Scheduling with deadlines |
