Data structures and Algorithms

Data structure and Algorithms

Sorting Algorithms:
- Bubble Sort
- Selection Sort (Coming Soon)
- Insertion Sort (Coming Soon)
- Merge Sort
- Quick Sort
- Heap Sort (Coming Soon)
- Counting Sort (Coming Soon)
- Radix Sort (Coming Soon)
Data Structures:
- Arrays (Coming Soon)
- Linked Lists
- Stacks
- Queues (Coming Soon)
- Trees
  - General Trees
  - Binary Trees (Coming Soon)
  - Binary Search Trees (Coming Soon)
  - AVL Trees (Coming Soon)
  - Red-Black Trees (Coming Soon)
- Graphs
  - Directed Graphs (Coming Soon)
  - Undirected Graphs (Coming Soon)
- Hash Tables (Coming Soon)
- Heaps
  - Min-Heap (Coming Soon)
  - Max-Heap (Coming Soon)
- Trie (Coming Soon)
Searching Algorithms:
- Linear Search (Coming Soon)
- Binary Search (Coming Soon)
- Depth-First Search (DFS) (Coming Soon)
- Breadth-First Search (BFS) (Coming Soon)
Graph Algorithms:
- Depth-First Search (DFS) (Coming Soon)
- Breadth-First Search (BFS) (Coming Soon)
- Shortest Path Algorithms (Dijkstra's, Bellman-Ford) (Coming Soon)
- Minimum Spanning Tree Algorithms (Prim's, Kruskal's) (Coming Soon)
Dynamic Programming:
- Fibonacci Series (Coming Soon)
- Longest Common Subsequence (LCS) (Coming Soon)
- Knapsack Problem (Coming Soon)
- Coin Change Problem (Coming Soon)
- Matrix Chain Multiplication (Coming Soon)
- Edit Distance (Coming Soon)
- Longest Increasing Subsequence (LIS) (Coming Soon)
Recursion:
- Factorial (Coming Soon)
- Fibonacci Series (Coming Soon)
- Tower of Hanoi (Coming Soon)
- Permutations and Combinations (Coming Soon)
Bit Manipulation:
- Bitwise AND, OR, XOR (Coming Soon)
- Bitwise Shifts (Coming Soon)
- Bitwise Operators for Setting, Clearing, and Toggling Bits (Coming Soon)
- Finding the Bit Representation of a Number (Coming Soon)
String Algorithms:
- String Matching Algorithms (Naive, Rabin-Karp, Knuth-Morris-Pratt) (Coming Soon)
- Longest Common Subsequence (LCS) (Coming Soon)
- Longest Palindromic Substring (Coming Soon)
- String Manipulation (Reversal, Rotation) (Coming Soon)