https://github.com/diogocarrola/leetcode75
The 75 most frequent LeetCode questions in coding interviews, curated by industry experts. The only resource you need for coding interviews.
https://github.com/diogocarrola/leetcode75
algorithms c coding-challenges cpp data-structures interview-preparation javascript leetcode python
Last synced: 7 days ago
JSON representation
The 75 most frequent LeetCode questions in coding interviews, curated by industry experts. The only resource you need for coding interviews.
- Host: GitHub
- URL: https://github.com/diogocarrola/leetcode75
- Owner: diogocarrola
- Created: 2025-03-25T23:47:26.000Z (7 months ago)
- Default Branch: main
- Last Pushed: 2025-06-08T22:59:14.000Z (4 months ago)
- Last Synced: 2025-06-08T23:28:34.865Z (4 months ago)
- Topics: algorithms, c, coding-challenges, cpp, data-structures, interview-preparation, javascript, leetcode, python
- Language: C
- Homepage: https://leetcode.com/problems/
- Size: 44.9 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- Contributing: CONTRIBUTING.md
Awesome Lists containing this project
README
# LeetCode 75 Essentials 🧑💻
**The minimal set of problems to pass coding interviews**
This repo contains the 75 most frequently asked LeetCode questions at top tech companies. Solve these, and you'll cover nearly every pattern interviewers test.
## ✅ **Progress Checklist**
**Instructions**:
- [ ] = Not started
- [x] = Completed
### **Array**
- [ ] [1. Two Sum](https://leetcode.com/problems/two-sum/) - Hash Map
- [ ] [121. Best Time to Buy/Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) - Sliding Window
- [ ] [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) - Hash Set
- [ ] [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) - Prefix/Suffix
- [ ] [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) - Kadane's Algorithm
- [ ] [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) - DP
- [ ] [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) - Binary Search
- [ ] [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) - Binary Search
- [ ] [15. 3Sum](https://leetcode.com/problems/3sum/) - Two Pointers
- [ ] [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/) - Two Pointers
### **Binary**
- [ ] [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) - Bit Manipulation
- [ ] [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) - Bit Count
- [ ] [338. Counting Bits](https://leetcode.com/problems/counting-bits/) - DP + Bits
- [ ] [268. Missing Number](https://leetcode.com/problems/missing-number/) - XOR
- [ ] [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) - Bit Manipulation
(full list continues in [PROGRESS.md](PROGRESS.md))
## 🚀 **How to Use This Repo**
1. **Study Order**:
- Follow the order in [PROGRESS.md](PROGRESS.md) for optimal learning.
- Start with Arrays, then move to Binary, Dynamic Programming, etc.
- Allocate 1-2 days per problem (30 mins solving, 30 mins reviewing solutions).
2. **For Each Problem**:
- Try solving it yourself first.
- If stuck after 30 mins, check the solution.
- Annotate your code with time/space complexity:
```python
# Time: O(n) | Space: O(1)
def solve():
"""Approach: Sliding Window"""
```
3. **Track Progress**:
- Update the progress checklist in [PROGRESS.md](PROGRESS.md).
- Review checked problems regularly to reinforce learning.
## 🔥 **Why These 75 Problems?**
- **Data-Driven**: Selected from top companies' interview frequency
- **Pattern-Centric**: Grouped by techniques (e.g., sliding window, DFS)
- **Time-Efficient**: Covers 90% of interview question patterns