LeetCode Practice 🧠

This repository contains my solutions to various LeetCode problems. The goal is to build strong problem-solving skills, understand algorithmic concepts deeply, and prepare for coding interviews by solving problems in a consistent and optimized way.

---

✅ Solved Problems

#	Title	Difficulty	Topic(s)	Solution	Language
2106	Maximum Fruits Harvested After at Most K Steps	Hard	Greedy, Sliding Window	hard/2106-maximum-fruits-harvested-after-at-most-k-steps.py	Python
3363	Find the Maximum Number of Fruits Collected	Easy	Array, Dynamic Programmming, Matrix	hard/3363-max-fruits-collected.py	Python
904	Fruit Into Baskets	Medium	Array, Hash Table, Sliding Window	medium/904-fruit-into-basket.py	Python
3477	Fruit Into Baskets II	Easy	Array, Binary Search, Segment Tree, Simulation, 1+	easy/3477-fruit-into-baskets-ii.py	Python
3479	Fruit Into Baskets III	Medium	Array, Binary Search, Segment Tree, Ordered Set	medium/3479-fruit-into-baskets-iii.py	Python
2529	Maximum Count of Positive Integer and Negative Integer	Easy	Array, Binary Search, Counting	easy/3479-fruit-into-baskets-iii.py	Python

---

📂 Folder Structure

leetcode-practice/
├── easy/
│ └── 2529-maximum-count-of-positive-and-negative.py
│ └── 3477-fruits-into-baskets.py
├── medium/
│ └── 904-fruit-into-basket.py
│ └── 3479-fruit-into-basket-iii.py
├── hard/
│ └── 2106-maximum-fruits-harvested-at-most-k-steps.py │ └── 3363-max-fruits-collected.py ├── README.md

---

🧠 Problem Notes

Each solution includes:

• Problem link and description
• Time and space complexity
• Edge cases handled
• Comments explaining the approach

---

🚀 Goals

• Solve problems consistently (daily or weekly)
• Understand core data structures and algorithms
• Optimize for performance (not just correctness)
• Build a public log of learning and growth

---

🛠️ Tech Stack

• Language: Python (for now)
• Platform: LeetCode
• Editor: VSCode

---

Feel free to star or fork if you find this structure helpful! 🌟