{"id":20617018,"url":"https://github.com/aglove2189/blind75","last_synced_at":"2026-04-22T10:31:50.206Z","repository":{"id":77300875,"uuid":"484886563","full_name":"aglove2189/blind75","owner":"aglove2189","description":"my python solutions to the Blind 75 LeetCode questions","archived":false,"fork":false,"pushed_at":"2022-04-24T20:22:07.000Z","size":4,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-06T19:23:38.351Z","etag":null,"topics":["leetcode"],"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/aglove2189.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":"2022-04-24T00:26:04.000Z","updated_at":"2022-04-24T00:32:48.000Z","dependencies_parsed_at":null,"dependency_job_id":"1fc7eca9-1bff-4b3d-a9c7-68d37d611c81","html_url":"https://github.com/aglove2189/blind75","commit_stats":null,"previous_names":[],"tags_count":0,"template":true,"template_full_name":null,"purl":"pkg:github/aglove2189/blind75","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aglove2189%2Fblind75","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aglove2189%2Fblind75/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aglove2189%2Fblind75/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aglove2189%2Fblind75/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aglove2189","download_url":"https://codeload.github.com/aglove2189/blind75/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aglove2189%2Fblind75/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32132138,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-22T08:34:57.708Z","status":"ssl_error","status_checked_at":"2026-04-22T08:34:55.583Z","response_time":58,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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"],"created_at":"2024-11-16T11:21:45.935Z","updated_at":"2026-04-22T10:31:50.189Z","avatar_url":"https://github.com/aglove2189.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Blind 75\n\n**Problem** | **Solution** | **Time** | **Space**\n-- | :-: | :-: | :-:\n[TwoSum](https://leetcode.com/problems/two-sum/) | [solution](solutions/twosum.py) | O(n) | O(n)\n[Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | [solution](solutions/isvalid.py) | O(n) | O(n)\n[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)\n[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)\n[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)\n[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)\n[Valid Anagram](https://leetcode.com/problems/valid-anagram)\n[Binary Search](https://leetcode.com/problems/binary-search)\n[Flood Fill](https://leetcode.com/problems/flood-fill)\n[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)\n[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)\n[Insert Interval](https://leetcode.com/problems/insert-interval)\n[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin)\n[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)\n[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)\n[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)\n[First Bad Version](https://leetcode.com/problems/first-bad-version)\n[Ransom Note](https://leetcode.com/problems/ransom-note)\n[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)\n[3Sum](https://leetcode.com/problems/3sum)\n[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)\n[Clone Graph](https://leetcode.com/problems/clone-graph)\n[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)\n[Course Schedule](https://leetcode.com/problems/course-schedule)\n[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)\n[Coin Change](https://leetcode.com/problems/coin-change)\n[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self)\n[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)\n[Longest Palindrome](https://leetcode.com/problems/longest-palindrome)\n[Min Stack](https://leetcode.com/problems/min-stack)\n[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)\n[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)\n[Number of Islands](https://leetcode.com/problems/number-of-islands)\n[Rotting Oranges](https://leetcode.com/problems/rotting-oranges)\n[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)\n[Combination Sum](https://leetcode.com/problems/combination-sum)\n[Permutations](https://leetcode.com/problems/permutations)\n[Merge Intervals](https://leetcode.com/problems/merge-intervals)\n[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)\n[Week Time Based Key-Value Store](https://leetcode.com/problems/week-time-based-key-value-store)\n[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)\n[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree)\n[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)\n[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream)\n[Majority Element](https://leetcode.com/problems/majority-element)\n[Add Binary](https://leetcode.com/problems/add-binary)\n[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree)\n[Week Middle of the Linked List](https://leetcode.com/problems/week-middle-of-the-linked-list)\n[Accounts Merge](https://leetcode.com/problems/accounts-merge)\n[Sort Colors](https://leetcode.com/problems/sort-colors)\n[Word Break](https://leetcode.com/problems/word-break)\n[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)\n[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi)\n[Spiral Matrix](https://leetcode.com/problems/spiral-matrix)\n[Subsets](https://leetcode.com/problems/subsets)\n[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)\n[Week Longest Palindromic Substring](https://leetcode.com/problems/week-longest-palindromic-substring)\n[Word Ladder](https://leetcode.com/problems/word-ladder)\n[Basic Calculator](https://leetcode.com/problems/basic-calculator)\n[Maximum Profit in Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling)\n[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)\n[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram)\n[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)\n[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)\n[Unique Paths](https://leetcode.com/problems/unique-paths)\n[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)\n[Container With Most Water](https://leetcode.com/problems/container-with-most-water)\n[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)\n[Word Search](https://leetcode.com/problems/word-search)\n[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string)\n[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees)\n[Task Scheduler](https://leetcode.com/problems/task-scheduler)\n[LRU Cache](https://leetcode.com/problems/lru-cache)\n[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faglove2189%2Fblind75","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faglove2189%2Fblind75","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faglove2189%2Fblind75/lists"}