# Blind 75刷題記錄
By Lun

參考[Blind 75 LeetCode Questions](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions)這個list，然後2024/11開始為了申請實習開始攻略哩扣

Array
---
- `Easy` [1. Two Sum](https://hackmd.io/@clh/leetcode-1)
- [121. Best Time to Buy and Sell Stock](https://hackmd.io/@clh/leetcode-121)
- [217. Contains Duplicate](https://hackmd.io/@clh/leetcode-217)
- `Medium` [238. Product of Array Except Self](https://hackmd.io/@clh/leetcode-238)
- [53. Maximum Subarray](https://hackmd.io/@clh/leetcode-53)
- [152. Maximum Product Subarray](https://hackmd.io/@clh/leetcode-152)
- [153. Find Minimum in Rotated Sorted Array](https://hackmd.io/@clh/leetcode-153)
- [33. Search in Rotated Sorted Array](https://hackmd.io/@clh/leetcode-33)
- [15. 3 Sum](https://hackmd.io/@clh/leetcode-15)
- 11. Container With Most Water

Binary
---
- `Easy` 191. Number of 1 Bits
- 338. Counting Bits
- 268. Missing Number
- 190. Reverse Bits
- `Medium` 371. Sum of Two Integers

Dynamic Programming
---
- `Easy` 70. Climbing Stairs
- `Medium` 322. Coin Change
- 300. Longest Increasing Subsequence
- 1143. Longest Common Subsequence
- 139. Word Break
- 377. Combination Sum IV
- 198. House Robber
- 213. House Robber II
- 91. Decode Ways
- 62. Unique Paths
- 55. Jump Game

Graph
---
`Medium` 133. Clone Graph
- 207. Course Schedule
- [417. Pacific Atlantic Water Flow](https://hackmd.io/@clh/leetcode-417)
- 200. Number of Islands
- [128. Longest Consecutive Sequence](https://hackmd.io/@clh/leetcode-128)

Interval
---
- `Medium` 57. Insert Interval
- 56. Merge Intervals
- 435. Non-overlapping Intervals

Linked List
---
- `Easy` 206. Reverse Linked List
- 141. Linked List Cycle
- 21. Merge Two Sorted Lists
- 19. Remove Nth Node From End of List
- 143. Reorder List
- `Hard` 23. Merge k Sorted Lists

Matrix
---
- `Medium` 73. Set Matrix Zeroes
- [54. Spiral Matrix](/@clh/leetcode-54)
- 48. Rotate Image
- 79. Word Search

Tree
---
- `Easy` 104. Maximum Depth of Binary Tree
- 100. Same Tree
- 226. Invert Binary Tree
- 572. Subtree of Another Tree
- `Medium` 102. Binary Tree Level Order Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 98. Validate Binary Search Tree
- 230. Kth Smallest Element in a BST
- 235. Lowest Common Ancestor of a Binary Search Tree
- 208. Implement Trie (Prefix Tree)
- 211. Design Add and Search Words Data Structure
- `Hard` 212. Word Search II
- 124. Binary Tree Maximum Path Sum
- 297. Serialize and Deserialize Binary Tree

Heap
---
- `Medium` 347. Top K Frequent Elements
- `Hard` 295. Find Median from Data Stream
- 23. Merge k Sorted Lists

Resources
---