All Lecture Links – Slideshare Introduction to Algorithms and Asymptotic Notation from Amrinder Arora Asymptotic Notation and Data Structures from Amrinder Arora Divide and Conquer – Part 1 from Amrinder Arora Divide and Conquer – Part II – Quickselect and Closest Pair of Points from Amrinder Arora Greedy Algorithms from Amrinder Arora Dynamic Programming – Part 1 from Amrinder Arora Dynamic Programming – Part II from Amrinder Arora Graph Traversal Algorithms – Depth First Search Traversal from Amrinder Arora Graph Traversal Algorithms – Breadth First Search from Amrinder Arora NP completeness from Amrinder Arora NP-Completeness – II from Amrinder Arora