Understand Data Structures

Overview-of-data-structures-set-1-linear-data-structures/

Overview-of-data-structures-set-2-binary-tree-bst-heap-and-hash/

Overview-of-data-structures-set-3-graph-trie-segment-tree-and-suffix-tree/

Abstract-data-types/

Understand Graph

Understand Heap

Understand Tree

Understand Sortings

Understand Stack & Queue

Analysis of Algorithms

1. Asymptotic Analysis
2. Worst, Average and Best Cases
3. Asymptotic Notations
4. Little o and little omega notations
5. Lower and Upper Bound Theory
6. Analysis of Loops
7. Solving Recurrences
8. Amortized Analysis
9. What does ‘Space Complexity’ mean?
10. Pseudo-polynomial Algorithms
11. NP-Completeness Introduction
12. Polynomial Time Approximation Scheme
13. A Time Complexity Question
14. Time Complexity of building a heap
15. Time Complexity where loop variable is incremented by 1, 2, 3, 4 ..
16. Time Complexity of Loop with Powers
17. Performance of loops (A caching question)