██╗     ███████╗███████╗████████╗ ██████╗ ██████╗ ██████╗ ███████╗
██║     ██╔════╝██╔════╝╚══██╔══╝██╔════╝██╔═══██╗██╔══██╗██╔════╝
██║     █████╗  █████╗     ██║   ██║     ██║   ██║██║  ██║█████╗  
██║     ██╔══╝  ██╔══╝     ██║   ██║     ██║   ██║██║  ██║██╔══╝  
███████╗███████╗███████╗   ██║   ╚██████╗╚██████╔╝██████╔╝███████╗
╚══════╝╚══════╝╚══════╝   ╚═╝    ╚═════╝ ╚═════╝ ╚═════╝ ╚══════╝

DURGA PRASAD KOTA · DATA STRUCTURES & ALGORITHMS · PYTHON

---

ABOUT

class Developer:
    Name       = "Durga Prasad Kota"
    Mission    = "Build the mindset of a problem solver"
    Language   = "Python"
    Philosophy = ["Think before you code", "Patterns over memorization", "Optimize everything"]

    def daily_routine(self):
        return ["Learn ✦ Practice ✦ Improve ✦ Repeat"]

This isn't just a solutions repo.
It's a documented war against mediocre thinking — every problem solved with intent, every pattern internalized, every complexity analyzed.

---

TECH STACK

Tool	Purpose
	Primary language — readable, fast, interview-friendly
	Practice platform
	Progress tracking & documentation

---

📚 TOPICS MASTERED

🧩 Topic	🧩 Topic	🧩 Topic
📦 Arrays & Strings	🫵 Two Pointers	🪟 Sliding Window
🗂️ Hashing	📚 Stack	🚶 Queue
🔁 Recursion	🔍 Binary Search	🔗 Linked List
🌳 Trees	🕸️ Graphs	🧮 Dynamic Programming
🧠 Greedy	♟ Backtracking	🚀 Problem Solving

Each topic is practiced with a focus on patterns, edge cases, and optimization.

Each topic is practiced until the pattern becomes instinct.

---

ROADMAP

📅 Month 1 — Strong Foundations

✅  Arrays & Strings     ──── Master in/out, traversal, manipulation
✅  Hashing              ──── Maps, sets, frequency counting
✅  Two Pointers         ──── Opposite ends, sliding window prep

📅 Month 2 — Pattern Mastery

⚡  Sliding Window       ──── Fixed & variable window problems
⚡  Stack & Queue        ──── Monotonic stacks, BFS foundations
⚡  Binary Search        ──── On answer, rotated arrays, search space

📅 Month 3 — Structural Thinking

🔜  Linked Lists         ──── Fast/slow pointer, reversal, merging
🔜  Trees                ──── DFS, BFS, LCA, diameter, path sum
🔜  Graphs               ──── Traversals, topological sort, union find

📅 Month 4 — Advanced Problem Solving

⏳  Dynamic Programming  ──── Memoization, tabulation, 1D/2D DP
⏳  Backtracking         ──── Permutations, combinations, N-Queens
⏳  Greedy               ──── Interval scheduling, activity selection

---

CONNECT

---

THINK DEEP  ·  CODE CLEAN  ·  GROW CONSISTENTLY