planned algos
-
Sorting Algorithms:
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort -
Searching Algorithms:
Linear Search
Binary Search -
Graph Algorithms:
Depth-First Search (DFS)
Breadth-First Search (BFS)
Dijkstra's Algorithm
Bellman-Ford Algorithm
Topological Sort -
Tree Algorithms:
Binary Search Tree (BST) Operations
Tree Traversal (Inorder, Preorder, Postorder)
Heap (Binary Heap) Operations -
Dynamic Programming:
Fibonacci Series
Longest Common Subsequence (LCS)
Knapsack Problem -
Divide and Conquer:
Closest Pair of Points
Strassen's Matrix Multiplication -
Greedy Algorithms:
Fractional Knapsack
Huffman Coding -
Backtracking Algorithms:
N-Queens Problem
Sudoku Solver -
String Algorithms:
String Matching Algorithms (Naive, KMP, Rabin-Karp)
Edit Distance (Levenshtein Distance) -
Numerical Algorithms:
Euclidean Algorithm (GCD)
Sieve of Eratosthenes (Prime Numbers)
Fast Exponentiation (Power in Logarithmic Time) -
Dynamic Data Structures:
Linked Lists
Stacks
Queues -
Hashing:
Hash Tables
Collision Resolution Techniques (Chaining, Open Addressing) -
Bit Manipulation:
Bitwise AND, OR, XOR, NOT
Bitwise Shifts -
Advanced Data Structures:
Trie
Segment Tree
Fenwick Tree (Binary Indexed Tree) -
Randomized Algorithms:
Randomized QuickSort
Monte Carlo Algorithms -
Graph Theory Concepts:
Minimum Spanning Tree
Shortest Path Algorithms
Network Flow Algorithms -
Computational Geometry:
Convex Hull Algorithms
Line Intersection -
Advanced Algorithms:
Bloom Filters
Suffix Trees -
Algorithmic Paradigms:
Greedy Algorithms
Dynamic Programming
Divide and Conquer