🧠 Data Structures & Algorithms — Problem Solving Journey

Welcome to my personal repository where I solve a wide variety of Data Structures and Algorithms problems from platforms like LeetCode, HackerRank, and Codeforces. This journey is not just about coding but also about developing problem-solving thinking, optimizing solutions, and building a strong foundation for coding interviews and real-world programming.

---

📚 What's Inside?

This repository is organized by pattern, topic, and difficulty, making it easier to browse and learn effectively.

✅ Solved Problems Breakdown

• ✅ Total Solved: 700+
• 💻 Platform: LeetCode
• 🗓️ Frequency: Daily Problem-Solving Habit (1–3 problems/day)

---

🚀 Problem Patterns Covered

📌 Sliding Window

• Maximum Sum Subarray of Size K
• Longest Substring with K Distinct Characters

📌 Two Pointers

• Container With Most Water
• Remove Duplicates from Sorted Array

📌 Fast and Slow Pointers

• Linked List Cycle Detection
• Middle of Linked List

📌 Binary Search

• Binary Search on Answer
• First and Last Position in Sorted Array

📌 Depth-First Search (DFS)

• Path Sum
• Subtree of Another Tree

📌 Breadth-First Search (BFS)

• Level Order Traversal
• Minimum Depth of Binary Tree

📌 Backtracking

• N-Queens
• Sudoku Solver

📌 Dynamic Programming (DP)

• House Robber
• Longest Palindromic Substring
• 0/1 Knapsack

📌 Greedy

• Jump Game
• Minimum Number of Arrows to Burst Balloons

📌 Graph Algorithms

• Topological Sort
• Union Find (Disjoint Set)
• Detect Cycle in Directed Graph

📌 Recursion and Divide & Conquer

• Merge Sort
• Quick Sort
• Power (x^n)

---

🛠️ Technologies Used

• Language: Python, JavaScript, and C++ (select problems)
• IDE: VS Code
• Platform: LeetCode
• Tools: Prettier, ESLint, Black

---

🧩 View the full LeetCode submissions or check out the detailed progress list

---

🧠 Learning Approach

1. Understand the problem and constraints.
2. Identify the pattern (Sliding Window, DFS, etc.).
3. Brute Force the solution, then optimize.
4. Code with clean syntax and comments.
5. Reflect on mistakes and log insights.

---