https://github.com/theexplainthis/leetcodejourney
提供演算法和 LeetCode 刷題全面的學習資源
https://github.com/theexplainthis/leetcodejourney
Last synced: 16 days ago
JSON representation
提供演算法和 LeetCode 刷題全面的學習資源
- Host: GitHub
- URL: https://github.com/theexplainthis/leetcodejourney
- Owner: TheExplainthis
- Created: 2023-12-20T00:31:44.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-02-28T04:52:57.000Z (about 1 year ago)
- Last Synced: 2024-02-29T03:22:30.263Z (about 1 year ago)
- Language: Python
- Homepage:
- Size: 2.65 MB
- Stars: 25
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Journey
## 介紹
歡迎來到 `LeetCode Journey`！這個 Repository 是一個專注於分享 LeetCode 題目的程式碼和解題思維的平台。無論你是剛開始程式設計之旅，還是尋求提升解題技巧的經驗豐富開發者，這裡都有你需要的資源。
## 目的
這個 Repository 的主要目的是：
* **提供清晰的解題思路**：每道題目都附有詳細的思維過程，幫助你理解不同的解題策略。
* **分享可執行的程式碼**：每道題目都有相對應的程式碼，你可以直接運行這些程式碼來檢驗其效果。
* **分類整理**：題目按照不同的類型和難易度進行分類，方便你根據自己的學習需求進行挑選。
## 內容
**Blind 75**
(以下題目含順序性，建議從上至下開始解題)
* Arrays & Hashing
* [(E) 1. Two Sum](solutions/1.%20Two%20Sum/)
* [(E) 217. Contains Duplicate](solutions/217.%20Contains%20Duplicate/)
* [(E) 242. Valid Anagram](solutions/242.%20Valid%20Anagram/)
* [(M) 49. Group Anagrams](solutions/49.%20Group%20Anagrams/)
* [(M) 128. Longest Consecutive Sequence](solutions/128.%20Longest%20Consecutive%20Sequence/)
* [(M) 347. Top K Frequent Elements](solutions/347.%20Top%20K%20Frequent%20Elements/)
* [(M) 238. Product of Array Except Self](solutions/238.%20Product%20of%20Array%20Except%20Self)
* [(M) 271. Encode and Decode Strings](solutions/271.%20Encode%20and%20Decode%20Strings)
* Two Pointers
* [(E) 125. Valid Palindrome](solutions/125.%20Valid%20Palindrome/)
* [(M) 11. Container With Most Water](solutions/11.%20Container%20With%20Most%20Water/)
* [(M) 15. 3Sum](solutions/15.%203Sum/)
* Sliding Window
* [(E) 121. Best Time to Buy and Sell Stock](solutions/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock/)
* [(M) 3. Longest Substring Without Repeating Characters](solutions/3.%20Longest%20Substring%20Without%20Repeating%20Characters)
* [(M) 424. Longest Repeating Character Replacement](solutions/424.%20Longest%20Repeating%20Character%20Replacement)
* [(H) 76. Minimum Window Substring](solutions/76.%20Minimum%20Window%20Substring/)
* Stack
* [(E) 20. Valid Parentheses](solutions/20.%20Valid%20Parentheses/)
* Binary Search
* [(M) 153. Find Minimum in Rotated Sorted Array](solutions/153.%20Find%20Minimum%20in%20Rotated%20Sorted%20Array/)
* [(M) 33. Search in Rotated Sorted Array](solutions/33.%20Search%20in%20Rotated%20Sorted%20Array/)
* Linked List
* [(E) 206. Reverse Linked List](solutions/206.%20Reverse%20Linked%20List/)
* [(E) 21. Merge Two Sorted Lists](solutions/21.%20Merge%20Two%20Sorted%20Lists/)
* [(E) 141. Linked List Cycle](solutions/141.%20Linked%20List%20Cycle/)
* [(M) 143. Reorder List](solutions/143.%20Reorder%20List/)
* [(M) 19. Remove Nth Node From End of List](solutions/19.%20Remove%20Nth%20Node%20From%20End%20of%20List/)
* [(M) 23. Merge k Sorted Lists](solutions/23.%20Merge%20k%20Sorted%20Lists/)
* Tree
* [(E) 104. Maximum Depth of Binary Tree](solutions/104.%20Maximum%20Depth%20of%20Binary%20Tree/)
* [(E) 226. Invert Binary Tree](solutions/226.%20Invert%20Binary%20Tree/)
* [(E) 100. Same Tree](solutions/100.%20Same%20Tree/)
* [(E) 572. Subtree of Another Tree](solutions/572.%20Subtree%20of%20Another%20Tree/)
* [(M) 235. Lowest Common Ancestor of a Binary Search Tree](solutions/235.%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/)
* [(M) 102. Binary Tree Level Order Traversal](solutions/102.%20Binary%20Tree%20Level%20Order%20Traversal/)
* [(M) 98. Validate Binary Search Tree](solutions/98.%20Validate%20Binary%20Search%20Tree/)
* [(M) 230. Kth Smallest Element in a BST](solutions/230.%20Kth%20Smallest%20Element%20in%20a%20BST/)
* [(M) 105. Construct Binary Tree from Preorder and Inorder Traversal](solutions/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/)
* [(H) 124. Binary Tree Maximum Path Sum](solutions/124.%20Binary%20Tree%20Maximum%20Path%20Sum/)
* [(H) 297. Serialize and Deserialize Binary Tree](solutions/297.%20Serialize%20and%20Deserialize%20Binary%20Tree/)
* Trie
* [(M) 208. Implement Trie (Prefix Tree)](solutions/208.%20Implement%20Trie%20(Prefix%20Tree)/)
* [(M) 211. Design Add and Search Words Data Structure](solutions/211.%20Design%20Add%20and%20Search%20Words%20Data%20Structure/)
* [(H) 212. Word Search II](solutions/212.%20Word%20Search%20II/)
* Heap
* [(H) 295. Find Median from Data Stream](solutions/295.%20Find%20Median%20from%20Data%20Stream/)
* Backtracking
* [(M) 39. Combination Sum](solutions/39.%20Combination%20Sum/)
* [(M) 79. Word Search](solutions/79.%20Word%20Search/)
* Graphs
* [(M) 200. Number of Islands](solutions/200.%20Number%20of%20Islands/)
* [(M) 133. Clone Graph](solutions/133.%20Clone%20Graph/)
* [(M) 417. Pacific Atlantic Water Flow](solutions/417.%20Pacific%20Atlantic%20Water%20Flow/)
* [(M) 207. Course Schedule](solutions/207.%20Course%20Schedule/)
* [(M) 323. Number of Connected Components in an Undirected Graph](solutions/323.%20Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/)
* [(M) 261. Graph Valid Tree](solutions/261.%20Graph%20Valid%20Tree/)
* Advanced Graphs
* [(H) 269. Alien Dictionary](solutions/269.%20Alien%20Dictionary/)
* 1-D Dynamic Programming
* [(E) 70. Climbing Stairs](solutions/70.%20Climbing%20Stairs/)
* [(M) 198. House Robber](solutions/198.%20House%20Robber/)
* [(M) 213. House Robber II](solutions/213.%20House%20Robber%20II/)
* [(M) 5. Longest Palindromic Substring](solutions/5.%20Longest%20Palindromic%20Substring/)
* [(M) 647. Palindromic Substrings](solutions/647.%20Palindromic%20Substrings/)
* [(M) 322. Coin Change](solutions/322.%20Coin%20Change/)
* [(M) 139. Word Break](solutions/139.%20Word%20Break/)
* [(M) 91. Decode Ways](solutions/91.%20Decode%20Ways/)
* [(M) 152. Maximum Product Subarray](solutions/152.%20Maximum%20Product%20Subarray/)
* [(M) 300. Longest Increasing Subsequence](solutions/300.%20Longest%20Increasing%20Subsequence/)
* 2-D Dynamic Programming
* [(M) 62. Unique Paths](solutions/62.%20Unique%20Paths/)
* [(M) 1143. Longest Common Subsequence](solutions/1143.%20Longest%20Common%20Subsequence/)
* Greedy
* [(M) 53. Maximum Subarray](solutions/53.%20Maximum%20Subarray/)
* [(M) 55. Jump Game](solutions/55.%20Jump%20Game/)
* Intervals
* * [(M) 56. Merge Intervals](solutions/56.%20Merge%20Intervals/)
* [(M) 57. Insert Interval](solutions/57.%20Insert%20Interval/)
* [(M) 435. Non-overlapping Intervals](solutions/435.%20Non-overlapping%20Intervals/)
* [(E) 252. Meeting Rooms](solutions/252.%20Meeting%20Rooms/)
* [(M) 253. Meeting Rooms II](solutions/253.%20Meeting%20Rooms%20II/)
* Math & Geometry
* [(M) 48. Rotate Image](solutions/48.%20Rotate%20Image/)
* [(M) 54. Spiral Matrix](solutions/54.%20Spiral%20Matrix/)
* [(M) 73. Set Matrix Zeroes](solutions/73.%20Set%20Matrix%20Zeroes/)
* Bit Manipulation
* [(E) 191. Number of 1 Bits](solutions/191.%20Number%20of%201%20Bits/)
* [(E) 338. Counting Bits](solutions/338.%20Counting%20Bits/)
* [(E) 190. Reverse Bits](solutions/190.%20Reverse%20Bits/)
* [(E) 268. Missing Number](solutions/268.%20Missing%20Number/)
* [(M) 371. Sum of Two Integers](solutions/371.%20Sum%20of%20Two%20Integers/)
> 更多題目和分類將持續更新中。
## 如何貢獻 How to Contribute
我們歡迎並感謝任何形式的貢獻。你可以通過以下方式參與：
- **提交新的解題思路**：如果你有不同的解題方法，歡迎提交。
- **改進現有程式碼**：對效率進行優化，或者使代碼更易於理解。
## 聯絡方式 Contact
如有任何問題或建議，請聯繫 [[email protected]]([email protected]) 。