---
# System prepended metadata

title: LeetCode目錄
tags: [Grind 169, LeetCode -Hard, LeetCode - Medium]

---

LeetCode目錄
===
> ***View the book with <i class="fa fa-book"></i> Book Mode.***
- [**LeetCode筆記目錄**](https://hackmd.io/@Wei-Yi-Yu/SyABdj_eA)
- [**Grind 169 參照網址**](https://www.techinterviewhandbook.org/grind75?weeks=26)
### Grind 169 
- [**0001. Two Sum**](https://hackmd.io/@Wei-Yi-Yu/Symr6gOE0)
- [**0020. Valid Parentheses**](https://hackmd.io/@Wei-Yi-Yu/r192GW_NR)
- [**0021. Merge Two Sorted Lists**](https://hackmd.io/@Wei-Yi-Yu/SyxF_-dN0)
- [**0067. Add Binary**](https://hackmd.io/@Wei-Yi-Yu/HysI_dO4R)
- [**0070. Climbing Stairs**](https://hackmd.io/@Wei-Yi-Yu/B1__w8ONR)
- [**0110. Balanced Binary Tree**](https://hackmd.io/@Wei-Yi-Yu/SkNfFH_VC)
- [**0121. Best Time to Buy and Sell Stock**](https://hackmd.io/@Wei-Yi-Yu/Hy112bu4A)
- [**0125. Valid Palindrome**](https://hackmd.io/@Wei-Yi-Yu/S1w9CZuV0)
- [**0141. Linked List Cycle**](https://hackmd.io/@Wei-Yi-Yu/S1gFQ3BdE0)
- [**0169. Majority Element**](https://hackmd.io/@Wei-Yi-Yu/ryEtZOONR)
- [**0206. Reverse Linked List**](https://hackmd.io/@Wei-Yi-Yu/ByjfC8ONC)
- [**0226. Invert Binary Tree**](https://hackmd.io/@Wei-Yi-Yu/r139NzO40)
- [**0232. Implement Queue using Stacks**](https://hackmd.io/@Wei-Yi-Yu/SkhZyLdNC)
- [**0235. Lowest Common Ancestor of a Binary Search Tree**](https://hackmd.io/@Wei-Yi-Yu/r1iBDr_ER)
- [**0242. Valid Anagram**](https://hackmd.io/@Wei-Yi-Yu/SJXbrEdNC)
- [**0278. First Bad Version**](https://hackmd.io/@Wei-Yi-Yu/BkSMVLu4A)
- [**0383. Ransom Note**](https://hackmd.io/@Wei-Yi-Yu/SkL3HLO40)
- [**0409. Longest Palindrome**](https://hackmd.io/@Wei-Yi-Yu/SkZZ98uN0)
- [**0704. Binary Search**](https://hackmd.io/@Wei-Yi-Yu/r1nlGrd4C)
- [**0733. Flood Fill**](https://hackmd.io/@Wei-Yi-Yu/BJHAVH_ER)
### Medium
- [**0005. Longest Palindromic Substring**](https://hackmd.io/@Wei-Yi-Yu/B11D77ibA)
- [**0015. 3Sum**](https://hackmd.io/@Wei-Yi-Yu/B1auGiafC)
- [**0016. 3Sum Closest**](https://hackmd.io/@Wei-Yi-Yu/ByXrT2Hm0)
- [**0235. Lowest Common Ancestor of a Binary Search Tree**](https://hackmd.io/@Wei-Yi-Yu/r1iBDr_ER)
- [**0310. Minimum Height Trees**](https://hackmd.io/@Wei-Yi-Yu/H1FYaCu-C)
- [**0752. Open the Lock**](https://hackmd.io/@Wei-Yi-Yu/HyKcc0dZA)
- [**0950. Reveal Cards In Increasing Order**](https://hackmd.io/@Wei-Yi-Yu/H1hd_i2lC)
- [**2370. Longest Ideal Subsequence**](https://hackmd.io/@Wei-Yi-Yu/HkUwyAubC)
- [**3159. Find Occurrences of an Element in an Array**](https://hackmd.io/@Wei-Yi-Yu/ByyZT-NEA)
- [**3160. Find the Number of Distinct Colors Among the Balls**](https://hackmd.io/@Wei-Yi-Yu/SksBxGE4C)
### Hard
- [**0042. Trapping Rain Water**](https://hackmd.io/@Wei-Yi-Yu/ryfXRj_eC)
- [**0076. Minimum Window Substring**](https://hackmd.io/@Wei-Yi-Yu/r1kJKnOlA)
- [**0123. Best Time to Buy and Sell Stock III**](https://hackmd.io/@WeiYee/Hy-Znp5Q0)
- [**0135. Candy**](https://hackmd.io/@Wei-Yi-Yu/Hy-Znp5Q0)
- [**2402. Meeting Rooms III**](https://hackmd.io/@Wei-Yi-Yu/HJcZj32xA)
- [**3149. Find the Minimum Cost Array Permutation**](https://hackmd.io/@Wei-Yi-Yu/Hkx7GMNNR)

