DSA Practice 🧠

Structured C++ solutions to LeetCode problems — organized by topic with time and space complexity notes.

---

Progress Tracker

Topic	Problems Solved	Status
Arrays	10	✅ Done
Strings	7	✅ Done
Linked List	6	✅ Done
Stack & Queue	5	✅ Done
Binary Search	6	✅ Done
Two Pointers	5	✅ Done
Sliding Window	5	✅ Done
Trees	6	✅ Done
Graphs	4	✅ Done
Dynamic Programming	3	🔄 In Progress

---

Structure

dsa-practice/
├── arrays/
├── strings/
├── linked-list/
├── trees/
├── graphs/
├── sliding-window/
├── binary-search/
├── two-pointers/
├── dp/
└── stack-queue/

---

How I approach each problem

1. Understand the problem and constraints
2. Think brute force first
3. Optimize — look for patterns (sliding window, two pointer, etc.)
4. Code it up in C++
5. Note time and space complexity

---

Connect

• LeetCode: ckprojects77
• GitHub: ckprojects77