CPP-DSA-Playground

Data Structures & Algorithms implementations in C++.

---

Purpose

• Implement DSA from scratch without STL dependencies
• Document working code with complexity analysis
• Practice for technical interviews

---

Structure

CPP-DSA-Playground/
├── arrays/
├── linked_list/
├── stack/
├── queue/
├── trees/
├── graphs/
├── sorting/
├── searching/
├── dynamic_programming/
├── problems/
└── notes/

Each folder contains implementation files, test cases, and complexity notes.

---

Completed

Structure	Status
Dynamic Array (Vector)	✅
Stack (Array + Linked List)	✅
Queue	✅
Bubble/Selection/Insertion Sort	✅

Planned

Structure	Algorithm
Deque	Merge Sort
Hash Table	Quick Sort
Binary Tree / BST	Binary Search
AVL Tree	BFS / DFS
Heap	Dijkstra
Segment Tree	Topological Sort
Union-Find	DP Problems

---

Build & Run

g++ -std=c++17 file.cpp -o output && ./output

---

Commit Convention

• feat: new implementation
• fix: bug fix
• docs: comments or README
• test: test cases
• refactor: code cleanup

---

Notes

• Manual memory management (new/delete)
• No STL containers used in core implementations
• Complexity noted in comments

---