"First, understand the structure. Then, master the algorithm."

---

🧭 What is DSA Genesis?

DSA Genesis is my personal, structured repository for everything related to Data Structures & Algorithms at BUET. It spans two semesters — from C++ fundamentals to advanced graph algorithms — and serves as both a learning journal and a reference archive.

This is not just code dumps. Each folder is organized to reflect the progression of a concept — from theory to implementation to problem-solving.

---

📑 Table of Contents

• Repository Structure
• Topics Covered — Level 1 (CSE-105)
• Topics Planned — Level 2 (CSE-207)
• How to Compile & Run
• Related Ecosystem
• References
• Contributing
• License
• Connect With Me

---

📂 Repository Structure

DSA_Genesis/
│
├── 00_Basic_C++/                    ← C++ prerequisite refresher
│   ├── 01_Intro/
│   ├── 02_Loops/
│   ├── 03_Pattern_Printing/
│   ├── 04_1D_Arrays/
│   ├── 05_2D_Arrays/
│   ├── 06_Strings/
│   ├── 07_Functions_&_Pointers/
│   ├── 08_Time_&_Space_Complexity/
│   ├── 09_Sorting/
│   ├── 10_Math_Function_&_OOP/
│   ├── 11_File_Handling/
│   └── Modern_Style_C++/
│
├── 01_Foundation/                   ← Asymptotic Analysis, Big-O, Proofs
│
├── 02_Sorting_Algorithms/           ← Classic sorting algorithms & analysis
│
├── 03_Data_Structures/              ← Core linear and hierarchical structures
│   ├── 01_Arrays/
│   ├── 02_Linked_List/
│   ├── 03_Stack/
│   ├── 04_Queue/
│   ├── 05_Binary_Tree/
│   ├── 06_Binary_Search_Tree/
│   └── 07_Heap/
│       ├── Max_Heap/
│       └── Min_Heap/
│
├── 04_Advanced_Design_&_Analysis/   ← Algorithm design paradigms
│   ├── 01_Divide_and_Conquer/
│   ├── 02_Dynamic_Programming/
│   └── 03_Greedy_Algorithms/
│
├── 05_Advanced_Data_Structures/     ← 🚧 AVL Tree, Red-Black Tree, Trie, Segment Tree, etc.
│
├── 06_Graph_Algorithms/             ← Complete graph theory coverage
│   ├── 01_Representation/
│   ├── 02_DFS/
│   ├── 03_BFS/
│   ├── 04_Shortest_Path/
│   ├── 05_MST/
│   └── Graphs/
│
├── 07_Miscellaneous/                ← 🚧 Bit Manipulation, Number Theory, STL, etc.
│
├── 08_Selected_Problems/            ← Topic-wise practice problems
│   ├── Linked_List/
│   ├── Stack/
│   ├── Queue/
│   ├── Binary_Tree/
│   ├── Heap/
│   └── Graph/
│
├── 10_Previous_Batches_Online/      ← Past Online Exam Solutions (Batch 22)
│
└── DSA_QB_BUET_TF.pdf               ← BUET DSA Question Bank

---

📘 Topics Covered — Level 1 (CSE-105)

00 · C++ Fundamentals

Prerequisite refresher covering modern C++ used throughout the repo.

Folder	Contents
01_Intro/	Basic I/O, control flow
02_Loops/	Iterative patterns
03_Pattern_Printing/	Triangle, diamond, number patterns
04_1D_Arrays/	Declaration, traversal
05_2D_Arrays/	Matrix operations
06_Strings/	string, char[], STL functions
07_Functions_&_Pointers/	Pass by value/reference, pointer arithmetic
08_Time_&_Space_Complexity/	Big-O analysis
09_Sorting/	Basic sorting implementations
10_Math_Function_&_OOP/	Classes, objects, cmath functions
11_File_Handling/	fstream, reading/writing files
Modern_Style_C++/	auto, range-for, lambdas, STL containers

---

01 · Foundation

Asymptotic analysis notes and proofs.

• Asymptotic Notations ($O$, $\Omega$, $\Theta$, $o$, $\omega$)
• Loop Analysis Patterns
• Recurrence Relations (Master Theorem, Recursion Tree)

---

02 · Sorting Algorithms

Six sorting algorithm implementations with complexity analysis.

• Insertion Sort
• Merge Sort
• Quick Sort
• Counting Sort
• Radix Sort
• Bucket Sort

---

03 · Core Data Structures

Hierarchical folder structure for linear and tree-based data structures.

Folder	Sub-folders & Contents
01_Arrays/	Insert, Delete, SubArray operations
02_Linked_List/	Singly LL, Doubly LL implementations
03_Stack/	Array-based, Vector-based, Linked-List-based, STL
04_Queue/	Array Queue, Linked-List Queue, deque, STL
05_Binary_Tree/	PreOrder, InOrder, PostOrder, LevelOrder traversals
06_Binary_Search_Tree/	Build, Search, Insert, Min/Max
07_Heap/	Max_Heap/ (Insert, Extract-Max), Min_Heap/ (Insert, Extract-Min)

---

04 · Advanced Design & Analysis

Algorithm design paradigms with implementations.

Folder	Contents
01_Divide_and_Conquer/	Binary Search, FindMax/FindMin, Merge Sort
02_Dynamic_Programming/	Climbing Stairs, Rod Cutting, LCS, Edit Distance, MCM, 0-1 Knapsack
03_Greedy_Algorithms/	Activity Selection, Fractional Knapsack

---

06 · Graph Algorithms

Full graph coverage with implementations.

Folder	Contents
01_Representation/	Adjacency Matrix, Adjacency List, Edge List
02_DFS/	Recursive & iterative DFS, Cycle detection, Connected components
03_BFS/	Level-order traversal, 0-1 BFS, Cycle detection
04_Shortest_Path/	Dijkstra's Algorithm (Min-heap implementation)
05_MST/	Kruskal's (DSU), Prim's Algorithm
Graphs/	Additional graph problems

---

08 · Selected Problems

Practice problems organized by data structure.

Folder	Problem Types
Linked_List/	Reversal, Cycle Detection, Merge Sorted Lists
Stack/	Valid Parentheses, Min Stack, Stock Span
Queue/	Sliding Window Max, Generate Binary Numbers
Binary_Tree/	Height, Diameter, LCA, Zigzag Traversal
Heap/	Kth Largest, Merge K Sorted Lists, Task Scheduler
Graph/	Number of Islands, Bipartite Check, Shortest Path

---

10 · Previous Batches Online's

• Sessional Problems: Section A, B, C's previous years online solution

---

🗺️ Topics Planned — Level 2 (CSE-207)

#	Folder	Status
1	05_Advanced_Data_Structures/ — AVL, Red-Black, B-Trees, Trie, Segment Tree, Fenwick Tree	🚧 Upcoming
2	07_Miscellaneous/ — Bit Manipulation, Number Theory	🚧 Upcoming
3	Advanced DP — TSP, Bitmask DP	🚧 Upcoming
4	String Algorithms — KMP, Rabin-Karp	🚧 Upcoming
5	Advanced Graph — Bellman-Ford, Floyd-Warshall, Topological Sort	🚧 Upcoming

---

⚙️ How to Compile & Run

All code is written in C++17. No external dependencies required.

Command line (GCC):

g++ -std=c++17 -O2 -Wall -o output filename.cpp
./output

VS Code: Install the C/C++ and Code Runner extensions, then press Ctrl+Alt+N.

Online: Compiler Explorer or OnlineGDB

---

🔗 Related Ecosystem

Repository	Description
🛠️ CSE_106	DSA Sessional — lab tasks & evaluation code
📦 OOPverse	Object-Oriented Programming concepts & lab
🎨 AlgoVista	Interactive visual dashboard for DSA
🧠 Leetcode_Crunches	Hand-curated LeetCode problems on DSA topics

---

📎 References

• 📖 Introduction to Algorithms — Cormen, Leiserson, Rivest, Stein (CLRS, 4th Ed.)
• 📖 Grokking Algorithms — Aditya Y. Bhargava (2nd Ed.)
• 📋 DSA QB BUET_TF.pdf — BUET DSA Question Bank (included in repo root)
• 🌐 CP-Algorithms — Competitive programming algorithm reference
• 🌐 Visualgo — Visual algorithm & data structure animations

---

🤝 Contributing

Contributions are welcome! If you'd like to contribute:

1. Fork the repository
2. Create a feature branch (git checkout -b feature/AmazingFeature)
3. Commit your changes (git commit -m 'Add some AmazingFeature')
4. Push to the branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

---

📜 License

This project is licensed under the MIT License - see the LICENSE file for details.

---

📬 Connect With Me

---

🌟 Star History

If you find this repository helpful, please give it a star! ⭐

---

Made with 🧠 by Badhon Pain