🧩 LeetCode 75 – Brute Force + Optimized Solutions

This repository contains my solutions for LeetCode 75, with:

• ✅ Brute Force Approach – to understand the problem deeply
• ⚡ Optimized Approach – to achieve the best possible time/space complexity
• 📝 Explanations & Key Takeaways – to help revise quickly

---

📊 Progress Tracker

Problems Solved	Total
9	75 ✅

---

🗂 Problem List

#	Pattern	Problem	Brute Force	Optimized
1	One Pointer	1768. Merge Strings Alternately	Done	Done
2	Recursion	1071. Greatest Common Divisor of Strings	Done	Done
3	Ad Hoc	1431. Kids With the Greatest Number of Candies	Done	Done
4	Greedy	605. Can Place Flowers	Done	Done
5	Two Pointers	345. Reverse Vowels of a String	Done	Done
6	Two Pointers	151. Reverse Words in a String	Done	Done
7	Prefix sum	238. Product of Array Except Self	Done	Done
8	Greedy	334. Increasing Triplet Subsequence	Done	Done
9	Two Pointers	443. String Compression	Done	Done

---

🛠 How to Use

Each problem folder contains:

• brute_force.py → naive solution
• optimized.py → best solution
• README.md → explanation, complexity, and key insights

---

🎯 Goals

• Build strong pattern recognition
• Practice writing clean, efficient code
• Create a resource I can revise before interviews