Solving LeetCode problems daily in Python to sharpen DSA skills.
| Difficulty | Solved |
|---|---|
| 🟢 Easy | 18 |
| 🟡 Medium | 5 |
| 🔴 Hard | 0 |
| Total | 23 |
| # | Problem | Solution | Time | Space |
|---|---|---|---|---|
| 020 | Valid Parentheses | Python | O(n) | O(n) |
| 035 | Search Insert Position | Python | O(n) | O(1) |
| 196 | Delete Duplicate Emails | MySQL | O(n^2) | O(n) |
| 217 | Contains Duplicate | Python | O(n) | O(n) |
| 228 | Summary Ranges | Python | O(n) | O(1) |
| 349 | Intersection of Two Arrays | Python | O(m + n) | O(m + n) |
| 350 | Intersection of Two Arrays II | Python | O(m + n) | O(m + n) |
| 628 | Maximum Product of Three Numbers | Python | O(n log n) | O(1) |
| 1009 | Complement of Base 10 Integer | Python | O(log n) | O(log n) |
| 1260 | Shift 2D Grid | Python | O(n·m) | O(n·m) |
| 1351 | Count Negative Numbers in a Sorted Matrix | Python | O(m + n) | O(1) |
| 1464 | Maximum Product of Two Elements in an Array | Python | O(n) | O(1) |
| 1979 | Find Greatest Common Divisor of Array | Python | O(n) | O(1) |
| 2553 | Separate the Digits in an Array | Python | O(n · d) | O(1) |
| 3536 | Maximum Product of Two Digits | Python | O(D) | O(D) |
| 3658 | GCD of Odd and Even Sums | Python | O(1) | O(1) |
| 3754 | Concatenate Non-Zero Digits and Multiply by Sum I | Python | O(D) | O(D) |
| 3986 | Number of Elapsed Seconds Between Two Times | Python | O(1) | O(1) |
| # | Problem | Solution | Time | Space |
|---|---|---|---|---|
| 075 | Sort Colors | Python | O(n log n) | O(1) |
| 1081 | Smallest Subsequence of Distinct Characters | Python | O(n) | O(k) |
| 3517 | Smallest Palindromic Rearrangement I | Python | O(n) | O(1) |
| 3867 | Sum of GCD of Formed Pairs | Python | O(n log n) | O(n) |
| 3987 | Minimum Total Cost to Process All Elements | Python | O(n) | O(1) |
- Python 🐍
- 🌐 Portfolio: david1-max.github.io
- 💼 LinkedIn: Divyanshu Yadav
- 📧 Email: yadavdavid382@gmail.com