GitHub - ydv-kanchan/Algorithm_DesignImplementation: This repository contains implementations of core algorithms and data structures in Java. It includes topics such as sorting, searching, recursion, dynamic programming, graph algorithms, greedy methods, hashing, trees, heaps, and more. The aim is to practice algorithm design, analyze complexities, and strengthen problem-solving skills for intervie

📘 Topics Covered

Complexity Analysis (Time & Space)
Sorting Algorithms (Merge, Quick, Heap, etc.)
Searching Algorithms (Linear, Binary)
Recursion & Backtracking (N-Queens, Maze Solver, etc.)
Dynamic Programming (Knapsack, LCS, Fibonacci, Matrix Chain Multiplication)
Greedy Algorithms (Activity Selection, Huffman Coding, MST)
Graph Algorithms (DFS, BFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim)
Trees & Binary Trees (Traversals, BST operations)
Heaps & Priority Queues
Hashing & Hash Tables
String Algorithms (Pattern Matching, etc.)

Clone the repository:

git clone https://github.com/your-username/Algorithm_DesignImplementation.git