🧪 DSA Journey Test

Welcome to my DSA Journey Test repository!
This is my personal space to test, analyze, and refine DSA (Data Structures and Algorithms) solutions.
Each program here is written to experiment with different logic approaches, performance improvements, and edge-case handling.

---

📂 Repository Structure

• Easy/ → Testing solutions for easy-level problems
• Medium/ → Testing solutions for medium-level problems
• Hard/ → Testing solutions for hard-level problems
• Experiments/ → Trying new patterns, techniques, or time-complexity comparisons

---

🛠️ Tech Stack

• Language: Java ☕
• Platform: LeetCode, GeeksforGeeks
• Tools: Git, VS Code / IntelliJ IDEA
• Testing Framework: JUnit (for verifying outputs and edge cases)

---

📈 Testing Progress

Difficulty	Tested Problems
Easy	173 ✅
Medium	25 ✅
Hard	02 ✅
Total	200 ✅

(I’ll keep updating this table as I test more DSA solutions.)

---

⚙️ What This Repo Includes

• 🧩 Test-driven DSA solutions (with example inputs and outputs)
• 🧠 Experimentation with multiple approaches for the same problem
• 🧰 Time and space complexity analysis
• 🧼 Clean and well-commented Java code

---

🔍 Testing Workflow

1. Write a DSA solution
2. Create test cases to validate logic and handle edge conditions
3. Compare results using different algorithmic approaches
4. Commit the tested version with performance notes

---

📚 LeetCode Profile

Check out my progress on LeetCode 🚀

---

🤝 Contributing

This is a personal DSA testing lab, but suggestions for improving test structure, optimization, or readability are always welcome.
You can open an issue or submit a pull request if you’d like to collaborate.

---

📄 License

This repository is licensed under the MIT License — feel free to explore and learn from it.

---

🧠 “Don’t just solve problems — test, break, and rebuild your logic.”