{"id":21407264,"url":"https://github.com/quibler7/leetcode-blind-75","last_synced_at":"2025-07-30T12:09:42.686Z","repository":{"id":273802674,"uuid":"753469665","full_name":"quibler7/LeetCode-BLIND-75","owner":"quibler7","description":"LeetCode Blind 75 🧠 is a curated list of the top 75 algorithm problems in LeetCode posted on the Blind platform. ","archived":false,"fork":false,"pushed_at":"2024-02-06T07:23:16.000Z","size":70,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-16T17:18:22.682Z","etag":null,"topics":["leetcode","leetcode-blind-75","leetcode-blind-75-python","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","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/quibler7.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"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}},"created_at":"2024-02-06T07:23:12.000Z","updated_at":"2024-11-06T13:27:28.000Z","dependencies_parsed_at":"2025-01-23T04:13:12.213Z","dependency_job_id":"a2375091-4ad2-4853-b70c-948f6b462c71","html_url":"https://github.com/quibler7/LeetCode-BLIND-75","commit_stats":null,"previous_names":["quibler7/leetcode-blind-75"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/quibler7/LeetCode-BLIND-75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/quibler7%2FLeetCode-BLIND-75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/quibler7%2FLeetCode-BLIND-75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/quibler7%2FLeetCode-BLIND-75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/quibler7%2FLeetCode-BLIND-75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/quibler7","download_url":"https://codeload.github.com/quibler7/LeetCode-BLIND-75/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/quibler7%2FLeetCode-BLIND-75/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267866255,"owners_count":24157344,"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","status":"online","status_checked_at":"2025-07-30T02:00:09.044Z","response_time":70,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["leetcode","leetcode-blind-75","leetcode-blind-75-python","leetcode-python","leetcode-solutions"],"created_at":"2024-11-22T16:45:29.026Z","updated_at":"2025-07-30T12:09:42.636Z","avatar_url":"https://github.com/quibler7.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🧠 LeetCode Blind 75\n\n# Description\n\n- Blind 75 is a curated list of the top 75 algorithm problems in LeetCode posted on the Blind platform by a Facebook engineer.\n\n- You can find further information at [this link](https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU).\n\n- The sequence of problems for this repository is followed as per the [NeetCode BLIND 75](https://neetcode.io/practice) List.\n\n- I have included the free links for Leetcode Premium Problems.\n  \n---\n\n\n# Problems\n\n**Array \u0026 Hashing**\n\n- [x]  [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)\n- [x]  [Valid Anagram](https://leetcode.com/problems/valid-anagram/)\n- [x]  [Two Sum](https://leetcode.com/problems/two-sum/)\n- [x]  [Group Anagrams](https://leetcode.com/problems/group-anagrams/)\n- [x]  [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)\n- [x]  [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)\n- [x]  [Encode and Decode Strings (Leetcode Premium)](https://neetcode.io/problems/string-encode-and-decode)\n- [x]  [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)\n\n---\n\n**Two Pointers**\n- [x]  [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)\n- [x]  [3 Sum](https://leetcode.com/problems/3sum/)\n- [x]  [Container With Most Water](https://leetcode.com/problems/container-with-most-water/)\n\n---\n\n**Sliding Window**\n\n- [x]  [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)\n- [x]  [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)\n- [x]  [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)\n- [x]  [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)\n\n---\n\n**Stack**\n\n- [x]  [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)\n\n---\n\n**Binary Search**\n\n- [x]  [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)\n- [x]  [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)\n\n---\n\n**Linked List**\n\n- [x]  [Reverse a Linked List](https://leetcode.com/problems/reverse-linked-list/)\n- [x]  [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)\n- [x]  [Reorder List](https://leetcode.com/problems/reorder-list/)\n- [x]  [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)\n- [x]  [Detect Cycle in a Linked List](https://leetcode.com/problems/linked-list-cycle/)\n- [x]  [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n\n---\n\n**Tree**\n\n- [x]  [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)\n- [x]  [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)\n- [x]  [Same Tree](https://leetcode.com/problems/same-tree/)\n- [x]  [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)\n- [x]  [Lowest Common Ancestor of BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)\n- [x]  [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)\n- [x]  [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)\n- [x]  [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)\n- [x]  [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)\n- [x]  [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)\n- [x]  [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)\n\n---\n\n**Trie**\n\n- [x]  [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)\n- [x]  [Add and Search Word](https://leetcode.com/problems/add-and-search-word-data-structure-design/)\n- [x]  [Word Search II](https://leetcode.com/problems/word-search-ii/)\n\n---\n\n**Heap/Priority Queue**\n\n- [x]  [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)\n\n---\n\n**Backtracking**\n\n- [x]  [Combination Sum](https://leetcode.com/problems/combination-sum-iv/)\n- [x]  [Word Search](https://leetcode.com/problems/word-search/)\n\n---\n\n**Graph**\n\n- [x]  [Number of Islands](https://leetcode.com/problems/number-of-islands/)\n- [x]  [Clone Graph](https://leetcode.com/problems/clone-graph/)\n- [x]  [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)\n- [x]  [Course Schedule](https://leetcode.com/problems/course-schedule/)\n- [x]  [Number of Connected Components in an Undirected Graph (Leetcode Premium)](https://neetcode.io/problems/count-connected-components)\n- [x]  [Graph Valid Tree (Leetcode Premium)](https://neetcode.io/problems/valid-tree)\n\n---\n\n**Advanced Graphs**\n\n- [x]  [Alien Dictionary (Leetcode Premium)](https://neetcode.io/problems/foreign-dictionary)\n\n---\n\n**1-D Dynamic Programming**\n\n- [x]  [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)\n- [x]  [House Robber](https://leetcode.com/problems/house-robber/)\n- [x]  [House Robber II](https://leetcode.com/problems/house-robber-ii/)\n- [x]  [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)\n- [x]  [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)\n- [x]  [Decode Ways](https://leetcode.com/problems/decode-ways/)\n- [x]  [Coin Change](https://leetcode.com/problems/coin-change/)\n- [x]  [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)\n- [x]  [Word Break](https://leetcode.com/problems/word-break/)\n- [x]  [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)\n\n---\n\n**2-D Dynamic Programming**\n- [x]  [Unique Paths](https://leetcode.com/problems/unique-paths/)\n- [x]  [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)\n\n---\n\n**Greedy**\n\n- [x]  [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)\n- [x]  [Jump Game](https://leetcode.com/problems/jump-game/)\n\n---\n\n**Intervals**\n\n- [x]  [Insert Interval](https://leetcode.com/problems/insert-interval/)\n- [x]  [Merge Intervals](https://leetcode.com/problems/merge-intervals/)\n- [x]  [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)\n- [x]  [Meeting Rooms (Leetcode Premium)](https://neetcode.io/problems/meeting-schedule)\n- [x]  [Meeting Rooms II (Leetcode Premium)](https://neetcode.io/problems/meeting-schedule-ii)\n\n---\n\n**Math \u0026 Geometry**\n\n- [x]  [Rotate Image](https://leetcode.com/problems/rotate-image/)\n- [x]  [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)\n- [x]  [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)\n\n---\n\n**Bit Manipulation**\n\n- [x]  [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)\n- [x]  [Counting Bits](https://leetcode.com/problems/counting-bits/)\n- [x]  [Reverse Bits](https://leetcode.com/problems/reverse-bits/)\n- [x]  [Missing Number](https://leetcode.com/problems/missing-number/)\n- [x]  [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)\n \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fquibler7%2Fleetcode-blind-75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fquibler7%2Fleetcode-blind-75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fquibler7%2Fleetcode-blind-75/lists"}