📘 Data Structures & Algorithms (DSA)

Welcome to my DSA Repository!
This repository is dedicated to my journey of learning and practicing Data Structures and Algorithms as part of my Computer Science & Engineering curriculum and personal development as a competitive programmer.

---

🚀 Goals of this Repository

• Build a strong foundation in Data Structures and Algorithms
• Practice problem-solving techniques for competitive programming
• Document learning materials for quick revision
• Improve coding efficiency and optimization skills

---

📂 Repository Structure

The repository will be organized by topics and concepts:

DSA/
│
├── 01_Basics/
│ ├── Complexity_Analysis/
│ └── Recursion/
│
├── 02_Data_Structures/
│ ├── Arrays/
│ ├── Strings/
│ ├── LinkedList/
│ ├── Stack/
│ ├── Queue/
│ ├── Deque/
│ ├── Hashing/
│ ├── Trees/
│ ├── Binary_Search_Tree/
│ ├── Heap/
│ ├── Graphs/
│ └── Disjoint_Set/
│
└── 03_Algorithms/
  ├── Sorting/
  ├── Searching/
  ├── Divide_and_Conquer/
  ├── Greedy/
  ├── Dynamic_Programming/
  ├── Backtracking/
  ├── Graph_Algorithms/
  │ ├── BFS_DFS/
  │ ├── Shortest_Path/
  │ ├── MST/
  │ └── Topological_Sort/
  └── String_Algorithms/

⚡ Note: This repository is a work in progress and will be updated regularly.

---

📑 Topics Covered / Learning Roadmap

✔️ Complexity Analysis (Time & Space)
✔️ Recursion & Backtracking
✔️ Arrays, Strings, Linked List
✔️ Stack, Queue, Deque
✔️ Hashing & HashMap
✔️ Trees & Binary Trees
✔️ Binary Search Trees (BST)
✔️ Heap & Priority Queue
✔️ Graph Algorithms (BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Kruskal, Prim, Topological Sort)
✔️ Sorting & Searching Algorithms
✔️ Divide & Conquer
✔️ Greedy Algorithms
✔️ Dynamic Programming (Knapsack, LIS, LCS, Matrix Chain Multiplication, etc.)
✔️ String Algorithms (KMP, Z-Algorithm, Rabin-Karp, Trie)
✔️ Disjoint Set Union (DSU)

---

📌 Author

• Rudra Kaiser

  • 🎓 CSE Student | Premier University, Chittagong
  • 💻 Competitive Programmer | Aspiring Software Engineer
  • 🌐 LinkedIn Profile

---