LeetCode Journey

介紹

歡迎來到 LeetCode Journey！這個 Repository 是一個專注於分享 LeetCode 題目的程式碼和解題思維的平台。無論你是剛開始程式設計之旅，還是尋求提升解題技巧的經驗豐富開發者，這裡都有你需要的資源。

目的

這個 Repository 的主要目的是：

• 提供清晰的解題思路：每道題目都附有詳細的思維過程，幫助你理解不同的解題策略。
• 分享可執行的程式碼：每道題目都有相對應的程式碼，你可以直接運行這些程式碼來檢驗其效果。
• 分類整理：題目按照不同的類型和難易度進行分類，方便你根據自己的學習需求進行挑選。

內容

Blind 75 (以下題目含順序性，建議從上至下開始解題)

• Arrays & Hashing

  • (E) 1. Two Sum
  • (E) 217. Contains Duplicate
  • (E) 242. Valid Anagram
  • (M) 49. Group Anagrams
  • (M) 128. Longest Consecutive Sequence
  • (M) 347. Top K Frequent Elements
  • (M) 238. Product of Array Except Self
  • (M) 271. Encode and Decode Strings

• Two Pointers

  • (E) 125. Valid Palindrome
  • (M) 11. Container With Most Water
  • (M) 15. 3Sum

• Sliding Window

  • (E) 121. Best Time to Buy and Sell Stock
  • (M) 3. Longest Substring Without Repeating Characters
  • (M) 424. Longest Repeating Character Replacement
  • (H) 76. Minimum Window Substring

• Stack

  • (E) 20. Valid Parentheses

• Binary Search

  • (M) 153. Find Minimum in Rotated Sorted Array
  • (M) 33. Search in Rotated Sorted Array

• Linked List

  • (E) 206. Reverse Linked List
  • (E) 21. Merge Two Sorted Lists
  • (E) 141. Linked List Cycle
  • (M) 143. Reorder List
  • (M) 19. Remove Nth Node From End of List
  • (M) 23. Merge k Sorted Lists

• Tree

  • (E) 104. Maximum Depth of Binary Tree
  • (E) 226. Invert Binary Tree
  • (E) 100. Same Tree
  • (E) 572. Subtree of Another Tree
  • (M) 235. Lowest Common Ancestor of a Binary Search Tree
  • (M) 102. Binary Tree Level Order Traversal
  • (M) 98. Validate Binary Search Tree
  • (M) 230. Kth Smallest Element in a BST
  • (M) 105. Construct Binary Tree from Preorder and Inorder Traversal
  • (H) 124. Binary Tree Maximum Path Sum
  • (H) 297. Serialize and Deserialize Binary Tree

• Trie

  • (M) 208. Implement Trie (Prefix Tree)
  • (M) 211. Design Add and Search Words Data Structure
  • (H) 212. Word Search II

• Heap

  • (H) 295. Find Median from Data Stream

• Backtracking

  • (M) 39. Combination Sum
  • (M) 79. Word Search

• Graphs

  • (M) 200. Number of Islands
  • (M) 133. Clone Graph
  • (M) 417. Pacific Atlantic Water Flow
  • (M) 207. Course Schedule
  • (M) 323. Number of Connected Components in an Undirected Graph
  • (M) 261. Graph Valid Tree

• Advanced Graphs

  • (H) 269. Alien Dictionary

• 1-D Dynamic Programming

  • (E) 70. Climbing Stairs
  • (M) 198. House Robber
  • (M) 213. House Robber II
  • (M) 5. Longest Palindromic Substring
  • (M) 647. Palindromic Substrings
  • (M) 322. Coin Change
  • (M) 139. Word Break
  • (M) 91. Decode Ways
  • (M) 152. Maximum Product Subarray
  • (M) 300. Longest Increasing Subsequence

• 2-D Dynamic Programming

  • (M) 62. Unique Paths
  • (M) 1143. Longest Common Subsequence

• Greedy

  • (M) 53. Maximum Subarray
  • (M) 55. Jump Game

• Intervals

• • (M) 56. Merge Intervals
  • (M) 57. Insert Interval
  • (M) 435. Non-overlapping Intervals
  • (E) 252. Meeting Rooms
  • (M) 253. Meeting Rooms II

• Math & Geometry

  • (M) 48. Rotate Image
  • (M) 54. Spiral Matrix
  • (M) 73. Set Matrix Zeroes

• Bit Manipulation

  • (E) 191. Number of 1 Bits
  • (E) 338. Counting Bits
  • (E) 190. Reverse Bits
  • (E) 268. Missing Number
  • (M) 371. Sum of Two Integers

更多題目和分類將持續更新中。

如何貢獻 How to Contribute

我們歡迎並感謝任何形式的貢獻。你可以通過以下方式參與：

• 提交新的解題思路：如果你有不同的解題方法，歡迎提交。
• 改進現有程式碼：對效率進行優化，或者使代碼更易於理解。

聯絡方式 Contact

如有任何問題或建議，請聯繫 hello@explainthis.io 。