1.
Array (with implementation)
1.1 Rotation of Array (implementation)
1.2 Rearranging an array (implementation)
1.3 Multidimensional array (implementation of 1d and 2d and rest only theory)
2. String (with implementation)
2.1 Subsequence and substring (implementation)
2.2 Reverse and rotation in a string (implementation)
2.3 Binary String (implementation)
2.4 Palindrome (implementation)
3. Linked List (with implementation)
3.1 Singly Linked List (with implementation)
3.2 Circular Linked List (only theory)
3.3 Doubly Linked List (only theory)
4. Stack (all operations implementation)
5. Queue & its type (all operations implementation and theory for types)
6. Tree Data Structure (only theory)
6.1 Binary Trees (only theory)
6.2 Tree Traversal (Inorder, Preorder, Postorder) (only theory & algorithm)
6.3 Binary Search Trees (only theory)
6.4 AVL Trees (only theory)
6.5 Red-Black Trees (only theory)
6.6 Complete Binary Tree (only theory)
6.7 Perfect Binary Tree (only theory)
7. Graph Data Structure (only theory)
8. Recursion (only theory)
8.1 Towers of Hanoi (TOH) (only theory)
9. Hashmaps (only theory)
10. Heap (only theory)
10.1 Min Heap (only theory)
10.2 Max Heap (only theory)
11. Algorithms (only algorithms, implementation not required for algorithms. If you have time
and you are interested to know more go through the implementation part)
11.1 Greedy Algorithms
11.1.1 Fractional Knapsack (only algorithm)
11.1.2 Dijkstra’s algorithm (only algorithm)
11.1.3 Kruskal’s algorithm (only algorithm)
11.1.4 Huffman coding (only algorithm)
11.1.5 Prim’s Minimum Spanning Tree (only algorithm)
11.2 Dynamic Programming
11.2.1 0/1 Knapsack (only algorithm)
11.2.2 Bellman Ford Algorithm (only algorithm)
11.2.3 House Robbery Problem (only algorithm)
11.2.4 Longest Common Subsequence (only algorithm)
11.2.5 Floyd-Warshall Algorithm (only algorithm)
11.3 Backtracking
11.3.1 Rat in a Maze (only algorithm)
11.3.2 N Queen Problem (only algorithm)
11.3.3 m Coloring Problem (only algorithm)
11.3.4 Hamiltonian Cycle (only algorithm)
11.3.5 Sudoku problem (only algorithm)
11.4 Memory Management
11.4.1 First Fit algorithm in Memory Management (only algorithm)
11.4.2 Best Fit algorithm in Memory Management (only algorithm)
11.4.3 Worst Fit algorithm in Memory Management (only algorithm)
11.5 Scheduling Algorithms (both preemptive & non-preemptive versions)
11.5.1 Shortest Job First (SJF) Scheduling Algorithm (only algorithm)
11.5.2 First Come First Serve (FCFS) Scheduling Algorithm (only algorithm)
11.5.3 RoundRobin Scheduling Algorithm (only algorithm)
11.5.4 Shortest Remaining Time First (SRTF) Scheduling Algorithm (only algorithm)
11.6 Graph Algorithms
11.6.1 Minimum Spanning Tree (Kruskal's and Prim's Algorithms) (only algorithm)
11.6.2 Shortest Path in Directed Acyclic Graph (only algorithm)
11.6.3 Shortest Path in Undirected Graph (only algorithm)
11.6.4 Dijkstra’s Algorithm (only algorithm)
11.6.5 Bellman-Ford Algorithm (only algorithm)
11.6.6 Floyd-Warshall Algorithm (only algorithm)
11.6.7 Depth First Search (DFS) (only algorithm)
11.6.8 Breadth First Search (BFS) (only algorithm)
11.6.9 Cycle Detection in a Graph (only algorithm)
11.7 Searching Algorithms
11.7.1 Linear Search (algorithm with implementation)
11.7.2 Binary Search (algorithm with implementation. Also try with recursion)
11.8 Sorting Algorithms
11.8.1 Bubble Sort (algorithm with implementation)
11.8.2 Selection Sort (algorithm with implementation)
11.8.3 Insertion Sort (algorithm with implementation)
11.8.4 Quick Sort (algorithm with implementation. Also try with recursion)
11.8.5 Merge Sort (algorithm with implementation. Also try with recursion)
11.9 Divide and Conquer
11.9.1 Quick Sort
11.9.2 Merge Sort
