{"id":26742306,"url":"https://github.com/diogocarrola/leetcode75","last_synced_at":"2025-10-06T23:27:13.494Z","repository":{"id":284454424,"uuid":"954989722","full_name":"diogocarrola/leetcode75","owner":"diogocarrola","description":"The 75 most frequent LeetCode questions in coding interviews, curated by industry experts. The only resource you need for coding interviews.","archived":false,"fork":false,"pushed_at":"2025-06-08T22:59:14.000Z","size":46,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-08T23:28:34.865Z","etag":null,"topics":["algorithms","c","coding-challenges","cpp","data-structures","interview-preparation","javascript","leetcode","python"],"latest_commit_sha":null,"homepage":"https://leetcode.com/problems/","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/diogocarrola.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-03-25T23:47:26.000Z","updated_at":"2025-06-08T22:59:19.000Z","dependencies_parsed_at":"2025-06-08T23:24:28.687Z","dependency_job_id":"eca29646-d00a-4812-94dd-b7ac89ccf4cf","html_url":"https://github.com/diogocarrola/leetcode75","commit_stats":null,"previous_names":["diogocarrola/leetcode75"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/diogocarrola/leetcode75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogocarrola%2Fleetcode75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogocarrola%2Fleetcode75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogocarrola%2Fleetcode75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogocarrola%2Fleetcode75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/diogocarrola","download_url":"https://codeload.github.com/diogocarrola/leetcode75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diogocarrola%2Fleetcode75/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265575493,"owners_count":23790778,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","c","coding-challenges","cpp","data-structures","interview-preparation","javascript","leetcode","python"],"created_at":"2025-03-28T06:17:23.555Z","updated_at":"2025-10-06T23:27:13.402Z","avatar_url":"https://github.com/diogocarrola.png","language":"C","readme":"# LeetCode 75 Essentials 🧑‍💻\n**The minimal set of problems to pass coding interviews**\n\nThis repo contains the 75 most frequently asked LeetCode questions at top tech companies. Solve these, and you'll cover nearly every pattern interviewers test.\n\n## ✅ **Progress Checklist**\n**Instructions**:\n- [ ] = Not started\n- [x] = Completed\n\n### **Array**\n- [ ] [1. Two Sum](https://leetcode.com/problems/two-sum/) - Hash Map\n- [ ] [121. Best Time to Buy/Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) - Sliding Window\n- [ ] [217. Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) - Hash Set\n- [ ] [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) - Prefix/Suffix\n- [ ] [53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) - Kadane's Algorithm\n- [ ] [152. Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) - DP\n- [ ] [153. Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) - Binary Search\n- [ ] [33. Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) - Binary Search\n- [ ] [15. 3Sum](https://leetcode.com/problems/3sum/) - Two Pointers\n- [ ] [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water/) - Two Pointers\n\n### **Binary**\n- [ ] [371. Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) - Bit Manipulation\n- [ ] [191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) - Bit Count\n- [ ] [338. Counting Bits](https://leetcode.com/problems/counting-bits/) - DP + Bits\n- [ ] [268. Missing Number](https://leetcode.com/problems/missing-number/) - XOR\n- [ ] [190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) - Bit Manipulation\n\n(full list continues in [PROGRESS.md](PROGRESS.md))\n\n## 🚀 **How to Use This Repo**\n1. **Study Order**:\n   - Follow the order in [PROGRESS.md](PROGRESS.md) for optimal learning.\n   - Start with Arrays, then move to Binary, Dynamic Programming, etc.\n   - Allocate 1-2 days per problem (30 mins solving, 30 mins reviewing solutions).\n\n2. **For Each Problem**:\n   - Try solving it yourself first.\n   - If stuck after 30 mins, check the solution.\n   - Annotate your code with time/space complexity:\n     ```python\n     # Time: O(n) | Space: O(1)\n     def solve():\n         \"\"\"Approach: Sliding Window\"\"\"\n     ```\n\n3. **Track Progress**:\n   - Update the progress checklist in [PROGRESS.md](PROGRESS.md).\n   - Review checked problems regularly to reinforce learning.\n\n## 🔥 **Why These 75 Problems?**\n- **Data-Driven**: Selected from top companies' interview frequency\n- **Pattern-Centric**: Grouped by techniques (e.g., sliding window, DFS)\n- **Time-Efficient**: Covers 90% of interview question patterns","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiogocarrola%2Fleetcode75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdiogocarrola%2Fleetcode75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiogocarrola%2Fleetcode75/lists"}