Welcome to the Data-Structure-and-Algorithms repository!
This repo contains implementations of popular Data Structures 🏗️ and Algorithms ⚡ to help you learn, practice, and master the fundamentals of computer science.
✅ Well-structured code examples
✅ Covers basic to advanced topics
✅ Clean explanations with comments
✅ Optimized solutions for better understanding
- 📦 Arrays
- 🔗 Linked List (Singly, Doubly, Circular)
- 📚 Stack & Queue
- 🌳 Trees (Binary Tree, BST, AVL, Heap)
- 🔗 Graphs (BFS, DFS, Shortest Path)
- 🧮 Hashing
- 🔍 Searching (Linear, Binary, Interpolation)
↕️ Sorting (Bubble, Selection, Insertion, Merge, Quick, Heap Sort)- 🧠 Dynamic Programming (Knapsack, LCS, LIS, etc.)
- 📊 Greedy Algorithms (Huffman, Kruskal, Prim’s)
- 🌐 Graph Algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)
- 🧩 Backtracking (N-Queens, Sudoku Solver, Rat in a Maze)
-
Clone the repository
git clone https://github.com/your-username/Data-Structure-and-Algorithms.git cd Data-Structure-and-Algorithms -
Run any code example
g++ arrays/example.cpp -o output ./output
- 📘 Strengthen DSA concepts for coding interviews
- 🏆 Improve problem-solving skills
- 🎓 Serve as a learning resource for students & developers
Contributions are welcome! ✨
- Fork 🍴 the repo
- Create a new branch 🌿
- Commit changes 💡
- Open a Pull Request 🔥