{"id":20384347,"url":"https://github.com/gyakobo/blind-75-leetcode-list","last_synced_at":"2025-08-23T02:04:53.171Z","repository":{"id":132953478,"uuid":"504860093","full_name":"Gyakobo/blind-75-leetcode-list","owner":"Gyakobo","description":"This github repo serves to educate any wonderer who comes upon this page of essential leetcode questions any programmer ought to know.","archived":false,"fork":false,"pushed_at":"2024-05-28T21:38:55.000Z","size":23,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-05-29T05:56:27.247Z","etag":null,"topics":["array","binary","binary-tree","boyer-moore","dynamic-programming","graph","heap","interval","kadanes-algorithm","linked-list","matrix","python3","string"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Gyakobo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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-06-18T14:05:45.000Z","updated_at":"2024-05-28T21:38:58.000Z","dependencies_parsed_at":"2024-05-20T22:11:00.600Z","dependency_job_id":"0b005764-cd6a-4c5a-b3a8-0dfae0219bac","html_url":"https://github.com/Gyakobo/blind-75-leetcode-list","commit_stats":null,"previous_names":["gyakobo/blind-75-leetcode-list"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gyakobo%2Fblind-75-leetcode-list","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gyakobo%2Fblind-75-leetcode-list/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gyakobo%2Fblind-75-leetcode-list/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gyakobo%2Fblind-75-leetcode-list/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Gyakobo","download_url":"https://codeload.github.com/Gyakobo/blind-75-leetcode-list/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241935269,"owners_count":20044827,"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":["array","binary","binary-tree","boyer-moore","dynamic-programming","graph","heap","interval","kadanes-algorithm","linked-list","matrix","python3","string"],"created_at":"2024-11-15T02:27:28.939Z","updated_at":"2025-03-04T23:13:02.709Z","avatar_url":"https://github.com/Gyakobo.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Blind 75 Leetcode List\r\n\r\n![image](https://img.shields.io/badge/-LeetCode-FFA116?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=black)\r\n![image](https://img.shields.io/badge/-Hackerrank-2EC866?style=for-the-badge\u0026logo=HackerRank\u0026logoColor=white)\r\n![image](https://img.shields.io/badge/LinkedIn-0077B5?style=for-the-badge\u0026logo=linkedin\u0026logoColor=white)\r\n\r\n![image](https://img.shields.io/badge/C-00599C?style=for-the-badge\u0026logo=c\u0026logoColor=white)\r\n![image](https://img.shields.io/badge/C%2B%2B-00599C?style=for-the-badge\u0026logo=c%2B%2B\u0026logoColor=white)\r\n![image](https://img.shields.io/badge/Python-FFD43B?style=for-the-badge\u0026logo=python\u0026logoColor=blue)\r\n![image](https://img.shields.io/badge/C%23-239120?style=for-the-badge\u0026logo=csharp\u0026logoColor=white)\r\n![image](https://img.shields.io/badge/JavaScript-323330?style=for-the-badge\u0026logo=javascript\u0026logoColor=F7DF1E)\r\n![image](https://img.shields.io/badge/Shell_Script-121011?style=for-the-badge\u0026logo=gnu-bash\u0026logoColor=white)\r\n![image](https://img.shields.io/badge/windows%20terminal-4D4D4D?style=for-the-badge\u0026logo=windows%20terminal\u0026logoColor=white)\r\n\r\n\u003e[!WARNING]\r\n\u003eThis project as of yet is still under heavy development and any contribution is highly appreciated\r\n\r\nAuthor: [Andrew Gyakobo](https://github.com/Gyakobo)\r\n\r\nA special thanks to my best friend [Ryan Eaton](https://github.com/R2bEEaton) for also contributing to this project!\r\n\r\nThis github repo serves to educate any wonderer who comes upon this page of the 75 essential leetcode questions any programmer ought to know. \r\n\r\n## Main Topics\r\n\r\n\u003cdetails\u003e\r\n\u003csummary\u003eArray\u003c/summary\u003e\r\n\u003cul\u003e\r\n    \u003cli\u003eTwo Sum - hashmap\u003c/li\u003e\r\n    \u003cli\u003eBest Time to Buy and Sell Stock - sliding window ⭐\u003c/li\u003e\r\n    \u003cli\u003eContains Duplicate - set / array ⭐\u003c/li\u003e\r\n    \u003cli\u003eProduct of Array Except Self - arithmetic ⭐\u003c/li\u003e\r\n    \u003cli\u003eMaximum Subarray - Kadane's theorem ⭐\u003c/li\u003e\r\n    \u003cli\u003eMaximum Product Subarray - dynamic programming ⭐\u003c/li\u003e\r\n    \u003cli\u003eFind Minimum in Rotated Sorted Array - binary search ⭐\u003c/li\u003e\r\n    \u003cli\u003eSearch in Rotated Sorted Array\u003c/li\u003e\r\n    \u003cli\u003e3 Sum - 3 pointers?\u003c/li\u003e\r\n    \u003cli\u003eContainer With Most Water\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eBinary\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eSum of Two Integers\u003c/li\u003e\r\n        \u003cli\u003eNumber of 1 Bits\u003c/li\u003e\r\n        \u003cli\u003eCounting Bits\u003c/li\u003e\r\n        \u003cli\u003eMissing Number - Gauss Summation ⭐\u003c/li\u003e\r\n        \u003cli\u003eReverse Bits\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eDynamic Programming\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eClimbing Stairs\u003c/li\u003e\r\n        \u003cli\u003eCoin Change\u003c/li\u003e\r\n        \u003cli\u003eLongest Increasing Subsequence\u003c/li\u003e\r\n        \u003cli\u003eLongest Common Subsequence\u003c/li\u003e\r\n        \u003cli\u003eWord Break Problem\u003c/li\u003e\r\n        \u003cli\u003eCombination Sum\u003c/li\u003e\r\n        \u003cli\u003eHouse Robber\u003c/li\u003e\r\n        \u003cli\u003eHouse Robber II\u003c/li\u003e\r\n        \u003cli\u003eDecode Ways\u003c/li\u003e\r\n        \u003cli\u003eUnique Paths\u003c/li\u003e\r\n        \u003cli\u003eJump Game\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eGraph\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eClone Graph\u003c/li\u003e\r\n        \u003cli\u003eCourse Schedule - DFS and dependency graph ⭐\u003c/li\u003e\r\n        \u003cli\u003ePacific Atlantic Water Flow\u003c/li\u003e\r\n        \u003cli\u003eNumber of Islands\u003c/li\u003e\r\n        \u003cli\u003eLongest Consecutive Sequence\u003c/li\u003e\r\n        \u003cli\u003eAlien Dictionary (Leetcode Premium)\u003c/li\u003e\r\n        \u003cli\u003eGraph Valid Tree (Leetcode Premium)\u003c/li\u003e\r\n        \u003cli\u003eNumber of Connected Components in an Undirected Graph (Leetcode Premium)\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eInterval\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eInsert Interval\u003c/li\u003e\r\n        \u003cli\u003eMerge Intervals\u003c/li\u003e\r\n        \u003cli\u003eNon-overlapping Intervals\u003c/li\u003e\r\n        \u003cli\u003eMeeting Rooms (Leetcode Premium)\u003c/li\u003e\r\n        \u003cli\u003eMeeting Rooms II (Leetcode Premium)\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eLinked List\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eReverse a Linked List\u003c/li\u003e\r\n        \u003cli\u003eDetect Cycle in a Linked List\u003c/li\u003e\r\n        \u003cli\u003eMerge Two Sorted Lists\u003c/li\u003e\r\n        \u003cli\u003eMerge K Sorted Lists\u003c/li\u003e\r\n        \u003cli\u003eRemove Nth Node From End Of List\u003c/li\u003e\r\n        \u003cli\u003eReorder List\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eMatrix\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eSet Matrix Zeroes\u003c/li\u003e\r\n        \u003cli\u003eSpiral Matrix\u003c/li\u003e\r\n        \u003cli\u003eRotate Image - Linear calculus, math formula\u003c/li\u003e\r\n        \u003cli\u003eWord Search\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eString\u003c/summary\u003e\r\n    \u003cul\u003e \r\n        \u003cli\u003eLongest Substring Without Repeating Characters\u003c/li\u003e\r\n        \u003cli\u003eLongest Repeating Character Replacement\u003c/li\u003e\r\n        \u003cli\u003eMinimum Window Substring\u003c/li\u003e\r\n        \u003cli\u003eValid Anagram - simple counter ⭐\u003c/li\u003e\r\n        \u003cli\u003eGroup Anagrams - hashmap ⭐\u003c/li\u003e\r\n        \u003cli\u003eValid Parentheses - stack ⭐\u003c/li\u003e\r\n        \u003cli\u003eValid Palindrome - Two pointers or Stack ⭐\u003c/li\u003e\r\n        \u003cli\u003eLongest Palindromic Substring\u003c/li\u003e\r\n        \u003cli\u003ePalindromic Substrings\u003c/li\u003e\r\n        \u003cli\u003eEncode and Decode Strings (Leetcode Premium)\u003c/li\u003e\r\n    \u003c/ul\u003e \r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eTree\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eMaximum Depth of Binary Tree\u003c/li\u003e\r\n        \u003cli\u003eSame Tree\u003c/li\u003e\r\n        \u003cli\u003eInvert/Flip Binary Tree\u003c/li\u003e\r\n        \u003cli\u003eBinary Tree Maximum Path Sum\u003c/li\u003e\r\n        \u003cli\u003eBinary Tree Level Order Traversal\u003c/li\u003e\r\n        \u003cli\u003eSerialize and Deserialize Binary Tree\u003c/li\u003e\r\n        \u003cli\u003eSubtree of Another Tree\u003c/li\u003e\r\n        \u003cli\u003eConstruct Binary Tree from Preorder and Inorder Traversal\u003c/li\u003e\r\n        \u003cli\u003eValidate Binary Search Tree\u003c/li\u003e\r\n        \u003cli\u003eKth Smallest Element in a BST\u003c/li\u003e\r\n        \u003cli\u003eLowest Common Ancestor of BST\u003c/li\u003e\r\n        \u003cli\u003eImplement Trie (Prefix Tree)\u003c/li\u003e\r\n        \u003cli\u003eAdd and Search Word\u003c/li\u003e\r\n        \u003cli\u003eWord Search II\u003c/li\u003e\r\n    \u003cul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eHeap\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eMerge K Sorted Lists\u003c/li\u003e\r\n        \u003cli\u003eTop K Frequent Elements\u003c/li\u003e\r\n        \u003cli\u003eFind Median from Data Stream\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003e [!NOTE]\r\n\u003e The following theorem's will be used to solve the aforementioned leetode questions: *Boyer-Moore theorem*, *Gauss's Summation theorem* and *Kadane's theorem* (Maximum Subarray).\r\n\r\n## Companies\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eApple\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eThree Sum ⭐\u003c/li\u003e \r\n        \u003cli\u003eMerge Intervals ⭐\u003c/li\u003e \r\n        \u003cli\u003eClone Directed Graph ⭐\u003c/li\u003e \r\n        \u003cli\u003eAdd Two Integers ⭐\u003c/li\u003e \r\n        \u003cli\u003eMerge Two Sorted Linked Lists ⭐\u003c/li\u003e \r\n        \u003cli\u003eDetermine if two binary trees are identical ⭐\u003c/li\u003e\r\n        \u003cli\u003eMirror Binary Tree ⭐\u003c/li\u003e\r\n        \u003cli\u003ePalindrome Substrings ⭐\u003c/li\u003e\r\n        \u003cli\u003eReverse Words in a Sentence ⭐\u003c/li\u003e \r\n        \u003cli\u003eLargest Sum Subarray ⭐\u003c/li\u003e\r\n        \u003cli\u003ePower of a number ⭐\u003c/li\u003e \r\n        \u003cli\u003eSearch in rotated array ⭐\u003c/li\u003e\r\n        \u003cli\u003eImplement an LRU cache ⭐\u003c/li\u003e \r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\u003cdetails\u003e\r\n    \u003csummary\u003eAtlassian\u003c/summary\u003e\r\n    \u003cul\u003e\r\n        \u003cli\u003eMajority Element ⭐\u003c/li\u003e\r\n        \u003cli\u003eGroup Anagrams\u003c/li\u003e\r\n        \u003cli\u003eStock Span\u003c/li\u003e\r\n    \u003c/ul\u003e\r\n\u003c/details\u003e\r\n\r\n\r\n## License\r\nMIT\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgyakobo%2Fblind-75-leetcode-list","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgyakobo%2Fblind-75-leetcode-list","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgyakobo%2Fblind-75-leetcode-list/lists"}