{"id":19188716,"url":"https://github.com/theexplainthis/leetcodejourney","last_synced_at":"2025-07-04T10:33:14.110Z","repository":{"id":213366776,"uuid":"733711988","full_name":"TheExplainthis/LeetCodeJourney","owner":"TheExplainthis","description":"提供演算法和 LeetCode 刷題全面的學習資源","archived":false,"fork":false,"pushed_at":"2024-04-23T18:01:26.000Z","size":2777,"stargazers_count":75,"open_issues_count":2,"forks_count":8,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-05-08T02:47:38.752Z","etag":null,"topics":[],"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/TheExplainthis.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,"zenodo":null}},"created_at":"2023-12-20T00:31:44.000Z","updated_at":"2025-05-01T12:38:37.000Z","dependencies_parsed_at":"2024-01-04T02:21:49.183Z","dependency_job_id":"e87f1817-d49d-45f0-af2a-b923247bd83c","html_url":"https://github.com/TheExplainthis/LeetCodeJourney","commit_stats":null,"previous_names":["theexplainthis/leetcodejourney"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/TheExplainthis/LeetCodeJourney","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheExplainthis%2FLeetCodeJourney","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheExplainthis%2FLeetCodeJourney/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheExplainthis%2FLeetCodeJourney/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheExplainthis%2FLeetCodeJourney/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/TheExplainthis","download_url":"https://codeload.github.com/TheExplainthis/LeetCodeJourney/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/TheExplainthis%2FLeetCodeJourney/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263493223,"owners_count":23475159,"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":[],"created_at":"2024-11-09T11:25:46.900Z","updated_at":"2025-07-04T10:33:14.075Z","avatar_url":"https://github.com/TheExplainthis.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Journey\n\n## 介紹\n歡迎來到 `LeetCode Journey`！這個 Repository 是一個專注於分享 LeetCode 題目的程式碼和解題思維的平台。無論你是剛開始程式設計之旅，還是尋求提升解題技巧的經驗豐富開發者，這裡都有你需要的資源。\n\n## 目的\n這個 Repository 的主要目的是：\n\n* **提供清晰的解題思路**：每道題目都附有詳細的思維過程，幫助你理解不同的解題策略。\n* **分享可執行的程式碼**：每道題目都有相對應的程式碼，你可以直接運行這些程式碼來檢驗其效果。\n* **分類整理**：題目按照不同的類型和難易度進行分類，方便你根據自己的學習需求進行挑選。\n\n## 內容\n**Blind 75**\n(以下題目含順序性，建議從上至下開始解題)\n* Arrays \u0026 Hashing\n    * [(E) 1. Two Sum](solutions/1.%20Two%20Sum/)\n    * [(E) 217. Contains Duplicate](solutions/217.%20Contains%20Duplicate/)\n    * [(E) 242. Valid Anagram](solutions/242.%20Valid%20Anagram/)\n    * [(M) 49. Group Anagrams](solutions/49.%20Group%20Anagrams/)\n    * [(M) 128. Longest Consecutive Sequence](solutions/128.%20Longest%20Consecutive%20Sequence/)\n    * [(M) 347. Top K Frequent Elements](solutions/347.%20Top%20K%20Frequent%20Elements/)\n    * [(M) 238. Product of Array Except Self](solutions/238.%20Product%20of%20Array%20Except%20Self)\n    * [(M) 271. Encode and Decode Strings](solutions/271.%20Encode%20and%20Decode%20Strings)\n    \n* Two Pointers\n    * [(E) 125. Valid Palindrome](solutions/125.%20Valid%20Palindrome/)\n    * [(M) 11. Container With Most Water](solutions/11.%20Container%20With%20Most%20Water/)\n    * [(M) 15. 3Sum](solutions/15.%203Sum/)\n\n* Sliding Window\n    * [(E) 121. Best Time to Buy and Sell Stock](solutions/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock/)\n    * [(M) 3. Longest Substring Without Repeating Characters](solutions/3.%20Longest%20Substring%20Without%20Repeating%20Characters)\n    * [(M) 424. Longest Repeating Character Replacement](solutions/424.%20Longest%20Repeating%20Character%20Replacement)\n    * [(H) 76. Minimum Window Substring](solutions/76.%20Minimum%20Window%20Substring/)\n\n* Stack\n    * [(E) 20. Valid Parentheses](solutions/20.%20Valid%20Parentheses/)\n\n* Binary Search\n    * [(M) 153. Find Minimum in Rotated Sorted Array](solutions/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/)\n    * [(M) 33. Search in Rotated Sorted Array](solutions/33.%20Search%20in%20Rotated%20Sorted%20Array/)\n\n* Linked List\n    * [(E) 206. Reverse Linked List](solutions/206.%20Reverse%20Linked%20List/)\n    * [(E) 21. Merge Two Sorted Lists](solutions/21.%20Merge%20Two%20Sorted%20Lists/)\n    * [(E) 141. Linked List Cycle](solutions/141.%20Linked%20List%20Cycle/)\n    * [(M) 143. Reorder List](solutions/143.%20Reorder%20List/)\n    * [(M) 19. Remove Nth Node From End of List](solutions/19.%20Remove%20Nth%20Node%20From%20End%20of%20List/)\n    * [(M) 23. Merge k Sorted Lists](solutions/23.%20Merge%20k%20Sorted%20Lists/)\n\n* Tree\n    * [(E) 104. Maximum Depth of Binary Tree](solutions/104.%20Maximum%20Depth%20of%20Binary%20Tree/)\n    * [(E) 226. Invert Binary Tree](solutions/226.%20Invert%20Binary%20Tree/)\n    * [(E) 100. Same Tree](solutions/100.%20Same%20Tree/)\n    * [(E) 572. Subtree of Another Tree](solutions/572.%20Subtree%20of%20Another%20Tree/)\n    * [(M) 235. Lowest Common Ancestor of a Binary Search Tree](solutions/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/)\n    * [(M) 102. Binary Tree Level Order Traversal](solutions/102.%20Binary%20Tree%20Level%20Order%20Traversal/)\n    * [(M) 98. Validate Binary Search Tree](solutions/98.%20Validate%20Binary%20Search%20Tree/)\n    * [(M) 230. Kth Smallest Element in a BST](solutions/230.%20Kth%20Smallest%20Element%20in%20a%20BST/)\n    * [(M) 105. Construct Binary Tree from Preorder and Inorder Traversal](solutions/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/)\n    * [(H) 124. Binary Tree Maximum Path Sum](solutions/124.%20Binary%20Tree%20Maximum%20Path%20Sum/)\n    * [(H) 297. Serialize and Deserialize Binary Tree](solutions/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/)\n\n* Trie\n  * [(M) 208. Implement Trie (Prefix Tree)](solutions/208.%20Implement%20Trie%20(Prefix%20Tree)/)\n  * [(M) 211. Design Add and Search Words Data Structure](solutions/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure/)\n  * [(H) 212. Word Search II](solutions/212.%20Word%20Search%20II/)\n\n* Heap\n  * [(H) 295. Find Median from Data Stream](solutions/295.%20Find%20Median%20from%20Data%20Stream/)\n\n* Backtracking\n  * [(M) 39. Combination Sum](solutions/39.%20Combination%20Sum/)\n  * [(M) 79. Word Search](solutions/79.%20Word%20Search/)\n\n* Graphs\n  * [(M) 200. Number of Islands](solutions/200.%20Number%20of%20Islands/)\n  * [(M) 133. Clone Graph](solutions/133.%20Clone%20Graph/)\n  * [(M) 417. Pacific Atlantic Water Flow](solutions/417.%20Pacific%20Atlantic%20Water%20Flow/)\n  * [(M) 207. Course Schedule](solutions/207.%20Course%20Schedule/)\n  * [(M) 323. Number of Connected Components in an Undirected Graph](solutions/323.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/)\n  * [(M) 261. Graph Valid Tree](solutions/261.%20Graph%20Valid%20Tree/)\n\n* Advanced Graphs\n  * [(H) 269. Alien Dictionary](solutions/269.%20Alien%20Dictionary/)\n\n* 1-D Dynamic Programming\n  * [(E) 70. Climbing Stairs](solutions/70.%20Climbing%20Stairs/)\n  * [(M) 198. House Robber](solutions/198.%20House%20Robber/)\n  * [(M) 213. House Robber II](solutions/213.%20House%20Robber%20II/)\n  * [(M) 5. Longest Palindromic Substring](solutions/5.%20Longest%20Palindromic%20Substring/)\n  * [(M) 647. Palindromic Substrings](solutions/647.%20Palindromic%20Substrings/)\n  * [(M) 322. Coin Change](solutions/322.%20Coin%20Change/)\n  * [(M) 139. Word Break](solutions/139.%20Word%20Break/)\n  * [(M) 91. Decode Ways](solutions/91.%20Decode%20Ways/)\n  * [(M) 152. Maximum Product Subarray](solutions/152.%20Maximum%20Product%20Subarray/)\n  * [(M) 300. Longest Increasing Subsequence](solutions/300.%20Longest%20Increasing%20Subsequence/)\n\n* 2-D Dynamic Programming\n  * [(M) 62. Unique Paths](solutions/62.%20Unique%20Paths/)\n  * [(M) 1143. Longest Common Subsequence](solutions/1143.%20Longest%20Common%20Subsequence/)\n\n* Greedy\n  * [(M) 53. Maximum Subarray](solutions/53.%20Maximum%20Subarray/)\n  * [(M) 55. Jump Game](solutions/55.%20Jump%20Game/)\n\n* Intervals\n* * [(M) 56. Merge Intervals](solutions/56.%20Merge%20Intervals/)\n  * [(M) 57. Insert Interval](solutions/57.%20Insert%20Interval/)\n  * [(M) 435. Non-overlapping Intervals](solutions/435.%20Non-overlapping%20Intervals/)\n  * [(E) 252. Meeting Rooms](solutions/252.%20Meeting%20Rooms/)\n  * [(M) 253. Meeting Rooms II](solutions/253.%20Meeting%20Rooms%20II/)\n\n* Math \u0026 Geometry\n  * [(M) 48. Rotate Image](solutions/48.%20Rotate%20Image/)\n  * [(M) 54. Spiral Matrix](solutions/54.%20Spiral%20Matrix/)\n  * [(M) 73. Set Matrix Zeroes](solutions/73.%20Set%20Matrix%20Zeroes/)\n\n* Bit Manipulation\n  * [(E) 191. Number of 1 Bits](solutions/191.%20Number%20of%201%20Bits/)\n  * [(E) 338. Counting Bits](solutions/338.%20Counting%20Bits/)\n  * [(E) 190. Reverse Bits](solutions/190.%20Reverse%20Bits/)\n  * [(E) 268. Missing Number](solutions/268.%20Missing%20Number/)\n  * [(M) 371. Sum of Two Integers](solutions/371.%20Sum%20of%20Two%20Integers/)\n\n\u003e 更多題目和分類將持續更新中。\n\n## 如何貢獻 How to Contribute\n\n我們歡迎並感謝任何形式的貢獻。你可以通過以下方式參與：\n\n- **提交新的解題思路**：如果你有不同的解題方法，歡迎提交。\n- **改進現有程式碼**：對效率進行優化，或者使代碼更易於理解。\n\n\n## 聯絡方式 Contact\n\n如有任何問題或建議，請聯繫 [hello@explainthis.io](hello@explainthis.io) 。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheexplainthis%2Fleetcodejourney","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheexplainthis%2Fleetcodejourney","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheexplainthis%2Fleetcodejourney/lists"}