shekhar-patil/data_structure_and_algorithms

1. Sorting Algorithms:

   • Bubble Sort
   • Selection Sort
   • Insertion Sort
   • Merge Sort
   • Quick Sort
   • Heap Sort
   • Counting Sort
   • Radix Sort

2. Data Structures:

   • Arrays
   • Linked Lists
     • Singly Linked Lists
     • Doubly Linked Lists
   • Stacks
   • Queues
   • Trees
     • General Trees
     • Binary Trees
     • Binary Search Trees
     • AVL Trees
     • Red-Black Trees
   • Graphs
     • Directed Graphs
     • Undirected Graphs
   • Hash Tables
   • Heaps
     • Min-Heap
     • Max-Heap
   • Trie

3. Searching Algorithms:

   • Linear Search
   • Binary Search
   • Depth-First Search (DFS)
   • Breadth-First Search (BFS)

4. Graph Algorithms:

   • Depth-First Search (DFS)
   • Breadth-First Search (BFS)
   • Shortest Path Algorithms (Dijkstra's, Bellman-Ford)
   • Minimum Spanning Tree Algorithms (Prim's, Kruskal's)

5. Dynamic Programming:

   • Fibonacci Series
   • Longest Common Subsequence (LCS)
   • Knapsack Problem
   • Coin Change Problem
   • Matrix Chain Multiplication
   • Edit Distance
   • Longest Increasing Subsequence (LIS)

6. Recursion:

   • Factorial
   • Fibonacci Series
   • Tower of Hanoi
   • Permutations and Combinations

7. Bit Manipulation:

   • Bitwise AND, OR, XOR
   • Bitwise Shifts
   • Bitwise Operators for Setting, Clearing, and Toggling Bits
   • Finding the Bit Representation of a Number

8. String Algorithms:

   • String Matching Algorithms (Naive, Rabin-Karp, Knuth-Morris-Pratt)
   • Longest Common Subsequence (LCS)
   • Longest Palindromic Substring
   • String Manipulation (Reversal, Rotation)