LeetCode Blind 75 (持續更新中…)

由來

Blind 75 是由 Facebook 工程師 Yangshun 創建的一個 LeetCode 問題清單。由於它涵蓋了許多面試中常見的內容，因此這個清單變得非常著名。

許多人準備面試時，就會以這份清單上的題目作為參考。

而為什麼會被稱作 Blind75 呢? 則是因為這份清單最早是出現在 Blind (https://www.teamblind.com) 這個網頁上。

而以上就是按照題目類型分的清單，以及我提供的解答及說明!

(會持續更新… 矩陣跟樹那邊實在是我的弱項…)

題目一覽

Array 陣列

• Two Sum 兩個數字的加總
• Best Time to Buy and Sell Stock 買賣股票最好的時機
• Contains Duplicate 包含重複項目
• Product of Array Except Self
• Maximum Subarray 最大的子陣列
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array 在旋轉後的陣列中找最小值
• Search in Rotated Sorted Array
• 3 Sum
• Container With Most Water

Binary 二進位

• Sum of Two Integers
• Number of 1 Bits
• Counting Bits
• Missing Number 缺少的數字
• Reverse Bits

Dynamic Programming 動態規劃

• Climbing Stairs 爬樓梯
• Coin Change
• Longest Increasing Subsequence
• Longest Common Subsequence
• Word Break Problem
• Combination Sum
• House Robber
• House Robber II
• Decode Ways
• Unique Paths
• Jump Game

Graph 圖形

• Clone Graph
• Course Schedule
• Pacific Atlantic Water Flow
• Number of Islands
• Longest Consecutive Sequence
• Alien Dictionary (Leetcode Premium)
• Graph Valid Tree (Leetcode Premium)
• Number of Connected Components in an Undirected Graph (Leetcode Premium)

Interval 間隔

• Insert Interval
• Merge Intervals
• Non-overlapping Intervals
• Meeting Rooms (Leetcode Premium)
• Meeting Rooms II (Leetcode Premium)

Linked List 鏈結串列

• Reverse a Linked List
• Detect Cycle in a Linked List
• Merge Two Sorted Lists
• Merge K Sorted Lists
• Remove Nth Node From End Of List
• Reorder List

Matrix 矩陣

• Set Matrix Zeroes
• Spiral Matrix
• Rotate Image
• Word Search

String 字串

• Longest Substring Without Repeating Characters 最長且沒有重複的子字串
• Longest Repeating Character Replacement
• Minimum Window Substring
• Valid Anagram 正確的易位構詞遊戲
• Group Anagrams
• Valid Parentheses
• Valid Palindrome 有效的迴文
• Longest Palindromic Substring
• Palindromic Substrings
• Encode and Decode Strings (Leetcode Premium)

Tree 樹

• Maximum Depth of Binary Tree
• Same Tree
• Invert/Flip Binary Tree
• Binary Tree Maximum Path Sum
• Binary Tree Level Order Traversal
• Serialize and Deserialize Binary Tree
• Subtree of Another Tree
• Construct Binary Tree from Preorder and Inorder Traversal
• Validate Binary Search Tree
• Kth Smallest Element in a BST
• Lowest Common Ancestor of BST
• Implement Trie (Prefix Tree)
• Add and Search Word
• Word Search II

Heap 堆積

• Merge K Sorted Lists
• Top K Frequent Elements
• Find Median from Data Stream