| Topic | Lecture |
|---|---|
| Introduction,key-concepts, and arrays | Lecture 01 |
| Time complexity analysis array,List, Iterators | Lecture 02 |
| Matrix | Lecture 02.1 |
| Recursion | Recursion |
| Sorting and Searching | Lecture 03 |
| Comparison functions, operators and lower/upper bounds | Lecture 03.1 |
| Math | Lecture 04 |
| Geometry | Lecture 05 |
| Strings | Lecture 06 |
| Popular problems patterns | Lecture 07 |
| Stack, queue,Deque, Heap and Fibonacci Heaps | Lecture 08 |
| Set and Map | Lecture 09 |
| Linked List, Double Linked List | Lecture 10 |
| Tree - Binary Tree - Binary Indexed Tree | Lecture 11 |
| Graph | Lecture 12 |
| Counting | Lecture 13 |
| Dynamic Programming | Lecture 14 |
| Greedy Algorithm | Lecture 15 |
| Bit Magic -- Bitwise Algorithm | Lecture 20 |
See here amazon possible interview questions
Contains all the slides used during the CS97 Algorithm and data structures at Stanford University
Geeks for geeks full algorithm list
| Topic | Lecture |
|---|---|
| Huffman Coding | Know more |
| Minimum Spanning tree Algorithm | Know more |
| Dijkstra's shortest Path | Know more |
| Min number of coins | Know more |
| Min NUmber of platforms required for a Railway/Bus station | Know more |
| Longest Palindromic substring | Know more |
| Belman-Ford for shortest pat | Know more |
| Optimal BST | Know more |
| Count ways to reach nth stair | Know more |
| Find the minimum cost to reach destination using a train | |
| Know more |