🚀 Daily LeetCode & DSA Journey

A dedicated repository tracking my daily Data Structures & Algorithms practice, problem-solving intuition, and runtime analysis. Synced directly from LeetCode.

---

🎯 Goals & Practice Strategy

• Consistency: 1+ problem solved daily.
• Complexity First: Analyze time and space complexity before coding; optimize from brute force to optimal patterns.
• Pattern Mastery: Focus on core paradigms: Prefix/Suffix Products, Hash Maps, Two Pointers, Sliding Window, Monotonic Stacks, and Trees.

---

📊 Solved Problems Index

Day	#	Problem	Topic	Difficulty	Optimal Approach	Time	Space
01	0217	Contains Duplicate	Arrays & Hashing	Easy	Hash Set Membership	$O(N)$	$O(N)$
02	0242	Valid Anagram	Arrays & Hashing	Easy	Frequency Array / Map	$O(N)$	$O(1)$
03	0001	Two Sum	Arrays & Hashing	Easy	One-Pass Hash Map	$O(N)$	$O(N)$
04	0049	Group Anagrams	Arrays & Hashing	Medium	Categorize by Sorted Str / Char Count Tuple	$O(N \cdot K \log K)$	$O(N \cdot K)$
05	0347	Top K Frequent Elements	Arrays & Hashing	Medium	Bucket Sort / Min-Heap	$O(N)$	$O(N)$
06	0238	Product of Array Except Self	Arrays & Hashing	Medium	Prefix & Postfix Running Products	$O(N)$	$O(1)^*$
07	0125	Valid Palindrome	Two Pointers	Easy	Two Pointers (Inward Scan with isalnum)	$O(N)$	$O(1)$
08	0167	Two Sum II - Input Array Is Sorted	Two Pointers	Medium	Two Pointers (Converging Left/Right Bounds)	$O(N)$	$O(1)$

*Note on #238: The output array does not count as extra space for complexity analysis.

---

📂 Repository Organization

Solutions are synced automatically upon receiving an Accepted verdict:

leetcode-solutions/
├── README.md
├── .gitignore
├── 0217-contains-duplicate/
│   ├── README.md                          # Problem statement & constraints
│   └── contains-duplicate.py              # Accepted implementation
├── 0242-valid-anagram/
│   ├── README.md
│   └── valid-anagram.py
├── 0001-two-sum/
│   ├── README.md
│   └── two-sum.py
├── 0049-group-anagrams/
│   ├── README.md
│   └── group-anagrams.py
├── 0347-top-k-frequent-elements/
│   ├── README.md
│   └── top-k-frequent-elements.py
└── 0238-product-of-array-except-self/
│   ├── README.md
│   └── product-of-array-except-self.py
└── 0125-valid-palindrome/
│   ├── README.md
│   └── valid-palindrome.py
└── 0167-two-sum-ii-input-array-is-sorted/
    ├── README.md
    └── two-sum-ii-input-array-is-sorted.py

⚙️ Setup & Tools

Platform: LeetCode

Automation: LeetSync / LeetHub v3 (automatic Git commits upon acceptance)

Primary Language: Python 3