50 Days of DSA Challenge - Java

📌 Overview

This repository is a dedicated archive of my 50 Days of DSA Challenge. Over the course of 50 days, I have consistently solved complex algorithmic problems to sharpen my problem-solving skills and master Data Structures and Algorithms using Java.

---

📊 Progress Statistics

Total Solved	🟢 Easy	🟡 Medium	🔴 Hard
50	34	12	4

---

📂 Repository Structure

The repository is organized by problem difficulty to facilitate easy navigation:

• 🟢 Easy: Foundational problems focusing on basic data structures (Arrays, Strings, Linked Lists).
• 🟡 Medium: Intermediate problems involving complex algorithms (Trees, Graphs, DP, Backtracking).
• 🔴 Hard: Advanced problems requiring deep optimization and complex logic.

---

🛠️ Tech Stack & Concepts

• Primary Language: Java ☕
• Core Concepts:
  • 🧩 Data Structures: Arrays, Linked Lists, Stacks, Queues, Hash Tables, Trees, Graphs.
  • ⚡ Algorithms: Sorting, Searching, Recursion, Dynamic Programming, Greedy, Sliding Window, Two Pointers.
  • 📉 Optimization: Focus on Time and Space Complexity (Big O notation).

---

📅 Progress Tracking

Below is a snapshot of some highlighted problems solved during this journey:

Day	Problem Name	Difficulty	Solution
1	Roman to Integer	🟢 Easy	View
18	Generate Parentheses	🟡 Medium	View
25	Reverse Nodes in k-Group	🔴 Hard	View
46	Convert Sorted List to BST	🟡 Medium	View
...	More solutions in respective folders	...	Explore All

---

🚀 How to Use

1. Clone the repository:

   git clone https://github.com/VIJAYAPANDIANT/LeetCode.git

2. Navigate to a folder:

   cd Easy

3. Open the solution: Each .java file contains the problem statement and the optimized solution.

---

🤝 Connect With Me

If you find these solutions helpful, feel free to ⭐ the repository and connect with me!

• GitHub: VIJAYAPANDIANT
• LinkedIn: VIJAYA PANDIAN T
• LeetCode: Profile

---

Happy Coding! 💻🔥