# 【LeetCode】目錄

* [1. Two Sum](https://hackmd.io/s/ryMr477o4)
* [2. Add Two Numbers](https://hackmd.io/s/BkO2UiOo4)
* [3. Longest Substring Without Repeating Characters](https://hackmd.io/s/Syx2fOXjE)
* [4. Median of Two Sorted Arrays](https://hackmd.io/s/HJCEiwYsE)
* [*5. Longest Palindromic Substring](https://hackmd.io/@Zero871015/LeetCode-5)
* [6. ZigZag Conversion](https://hackmd.io/s/rJTYGNvjE)
* [7. Reverse Integer](https://hackmd.io/s/Sy-vVI2oN)
* [9. Palindrome Number](https://hackmd.io/s/rJUL2yIoV)
* [11. Container With Most Water](https://hackmd.io/s/BJbqwPKs4)
* [12. Integer to Roman](https://hackmd.io/s/rk6IZJo6V)
* [13. Roman to Integer](https://hackmd.io/s/H1CXp122V)
* [14. Longest Common Prefix](https://hackmd.io/s/rJbjR9FTE)
* [*15. 3Sum](https://hackmd.io/@Zero871015/LeetCode-15)
* [17. Letter Combinations of a Phone Number](https://hackmd.io/@Zero871015/LeetCode-17)
* [19. Remove Nth Node From End of List](https://hackmd.io/@Zero871015/LeetCode-19)
* [20. Valid Parentheses](https://hackmd.io/s/r16P8wun4)
* [21. Merge Two Sorted Lists](https://hackmd.io/s/ry_3HDnsV)
* [24. Swap Nodes in Pairs](https://hackmd.io/s/S1LCrQvnV)
* [26. Remove Duplicates from Sorted Array](https://hackmd.io/s/SyVXfGv3E)
* [27. Remove Element](https://hackmd.io/s/SJ6gTYznN)
* [33. Search in Rotated Sorted Array](https://hackmd.io/@Zero871015/LeetCode-33)
* [35. Search Insert Position](https://hackmd.io/s/SJh78HhaN)
* [36. Valid Sudoku](https://hackmd.io/@Zero871015/LeetCode-36)
* [38. Count and Say](https://hackmd.io/@Zero871015/LeetCode-38)
* [39. Combination Sum](https://hackmd.io/@Zero871015/LeetCode-39)
* [*42. Trapping Rain Water](https://hackmd.io/s/H1s4-binN)
* [43. Multiply Strings](https://hackmd.io/@Zero871015/LeetCode-43)
* [45. Jump Game II](https://hackmd.io/@Zero871015/LeetCode-45)
* [46. Permutations](https://hackmd.io/@Zero871015/LeetCode-46)
* [47. Permutations II](https://hackmd.io/@Zero871015/LeetCode-47)
* [48. Rotate Image](https://hackmd.io/s/rJqxfguhN)
* [49. Group Anagrams](https://hackmd.io/@Zero871015/LeetCode-49)
* [50. Pow(x, n)](https://hackmd.io/@Zero871015/LeetCode-50)
* [*53. Maximum Subarray](https://hackmd.io/s/HyGNZ4Sp4)
* [54. Spiral Matrix](https://hackmd.io/@Zero871015/LeetCode-54)
* [55. Jump Game](https://hackmd.io/s/S1JFXHxaN)
* [56. Merge Intervals](https://hackmd.io/@Zero871015/LeetCode-56)
* [58. Length of Last Word](https://hackmd.io/@Zero871015/LeetCode-58)
* [59. Spiral Matrix II](https://hackmd.io/@Zero871015/LeetCode-59)
* [*60. Permutation Sequence](https://hackmd.io/@Zero871015/LeetCode-60)
* [*61. Rotate List](https://hackmd.io/s/rkPQgLgpV)
* [62. Unique Paths](https://hackmd.io/s/B1bIHIlTN)
* [63. Unique Paths II](https://hackmd.io/s/rkWmR6u64)
* [64. Minimum Path Sum](https://hackmd.io/@Zero871015/LeetCode-64)
* [66. Plus One](https://hackmd.io/s/HyAb2JihN)
* [67. Add Binary](https://hackmd.io/@Zero871015/LeetCode-67)
* [69. Sqrt(x)](https://hackmd.io/@Zero871015/LeetCode-69)
* [70. Climbing Stairs](https://hackmd.io/s/Bk0sUkGh4)
* [72. Edit Distance](https://hackmd.io/@Zero871015/BJUnenCiV)
* [73. Set Matrix Zeroes](https://hackmd.io/@Zero871015/LeetCode-73)
* [74. Search a 2D Matrix](https://hackmd.io/s/ryq1LoLaN)
* [78. Subsets](https://hackmd.io/s/SJn2Mg3h4)
* [79. Word Search](https://hackmd.io/@Zero871015/LeetCode-79)
* [83. Remove Duplicates from Sorted List](https://hackmd.io/s/SJjXoJM3E)
* [94. Binary Tree Inorder Traversal](https://hackmd.io/s/rJeTH3bT4)
* [98. Validate Binary Search Tree](https://hackmd.io/@Zero871015/LeetCode-98)
* [100. Same Tree](https://hackmd.io/s/BJVIWkGhN)
* [101. Symmetric Tree](https://hackmd.io/@Zero871015/LeetCode-101)
* [102. Binary Tree Level Order Traversal](https://hackmd.io/@Zero871015/LeetCode-102)
* [103. Binary Tree Zigzag Level Order Traversal](https://hackmd.io/@Zero871015/LeetCode-103)
* [104. Maximum Depth of Binary Tree](https://hackmd.io/@Zero871015/LeetCode-104)
* [105. Construct Binary Tree from Preorder and Inorder Traversal](https://hackmd.io/@Zero871015/LeetCode-105)
* [107. Binary Tree Level Order Traversal II](https://hackmd.io/@Zero871015/LeetCode-107)
* [108. Convert Sorted Array to Binary Search Tree](https://hackmd.io/@Zero871015/LeetCode-108)
* [109. Convert Sorted List to Binary Search Tree](https://hackmd.io/@Zero871015/LeetCode-109)
* [110. Balanced Binary Tree](https://hackmd.io/@Zero871015/LeetCode-110)
* [111. Minimum Depth of Binary Tree](https://hackmd.io/@Zero871015/LeetCode-111)
* [112. Path Sum](https://hackmd.io/@Zero871015/LeetCode-112)
* [113. Path Sum II](https://hackmd.io/@Zero871015/LeetCode-113)
* [118. Pascal’s Triangle](https://hackmd.io/@Zero871015/LeetCode-118)
* [119. Pascal’s Triangle II](https://hackmd.io/@Zero871015/LeetCode-119)
* [120. Triangle](https://hackmd.io/@Zero871015/LeetCode-120)
* [121. Best Time to Buy and Sell Stock](https://hackmd.io/@Zero871015/LeetCode-121)
* [122. Best Time to Buy and Sell Stock II](https://hackmd.io/@Zero871015/LeetCode-122)
* [124. Binary Tree Maximum Path Sum](https://hackmd.io/@Zero871015/LeetCode-124)
* [130. Surrounded Regions](https://hackmd.io/@Zero871015/LeetCode-130)
* [136. Single Number](https://hackmd.io/@Zero871015/LeetCode-136)
* [137. Single Number II](https://hackmd.io/@Zero871015/LeetCode-137)
* [141. Linked List Cycle](https://hackmd.io/@Zero871015/LeetCode-141)
* [143. Reorder List](https://hackmd.io/@Zero871015/LeetCode-143)
* [144. Binary Tree Preorder Traversal](https://hackmd.io/s/H1wDu2-p4)
* [145. Binary Tree Postorder Traversal](https://hackmd.io/s/BkETP3WaN)
* [146. LRU Cache](https://hackmd.io/@Zero871015/LeetCode-146)
* [150. Evaluate Reverse Polish Notation](https://hackmd.io/@Zero871015/LeetCode-150)
* [155. Min Stack](https://hackmd.io/@Zero871015/LeetCode-155)
* [169. Majority Element](https://hackmd.io/@Zero871015/LeetCode-169)
* [171. Excel Sheet Column Number](https://hackmd.io/@Zero871015/LeetCode-171)
* [198. House Robber](https://hackmd.io/@Zero871015/LeetCode-198)
* [200. Number of Islands](https://hackmd.io/@Zero871015/LeetCode-200)
* [201. Bitwise AND of Numbers Range](https://hackmd.io/@Zero871015/LeetCode-201)
* [202. Happy Number](https://hackmd.io/s/rJSszqMCN)
* [206. Reverse Linked List](https://hackmd.io/@Zero871015/LeetCode-206)
* [207. Course Schedule](https://hackmd.io/@Zero871015/LeetCode-207)
* [208. Implement Trie (Prefix Tree)](https://hackmd.io/@Zero871015/LeetCode-208)
* [221. Maximal Square](https://hackmd.io/@Zero871015/LeetCode-221)
* [226. Invert Binary Tree](https://hackmd.io/@Zero871015/LeetCode-226)
* [230. Kth Smallest Element in a BST](https://hackmd.io/@Zero871015/LeetCode-230)
* [231. Power of Two](https://hackmd.io/@Zero871015/LeetCode-231)
* [237. Delete Node in a Linked List](https://hackmd.io/@Zero871015/LeetCode-237)
* [238. Product of Array Except Self](https://hackmd.io/@Zero871015/LeetCode-238)
* [257. Binary Tree Paths](https://hackmd.io/@Zero871015/LeetCode-257)
* [258. Add Digits](https://hackmd.io/@Zero871015/LeetCode-258)
* [263. Ugly Number](https://hackmd.io/@Zero871015/LeetCode-263)
* [268. Missing Number](https://hackmd.io/@Zero871015/LeetCode-268)
* [278. First Bad Version](https://hackmd.io/@Zero871015/LeetCode-278)
* [283. Move Zeroes](https://hackmd.io/s/ryv1WcfhV)
* [289. Game of Life](https://hackmd.io/s/SJd4Qy32E)
* [292. Nim Game](https://hackmd.io/@Zero871015/LeetCode-292)
* [299. Bulls and Cows](https://hackmd.io/@Zero871015/LeetCode-299)
* [328. Odd Even Linked List](https://hackmd.io/@Zero871015/LeetCode-328)
* [338. Counting Bits](https://hackmd.io/@Zero871015/LeetCode-338)
* [343. Integer Break](https://hackmd.io/@Zero871015/LeetCode-343)
* [344. Reverse String](https://hackmd.io/@Zero871015/LeetCode-344)
* [367. Valid Perfect Square](https://hackmd.io/@Zero871015/LeetCode-367)
* [383. Ransom Note](https://hackmd.io/@Zero871015/LeetCode-383)
* [387. First Unique Character in a String](https://hackmd.io/@Zero871015/LeetCode-387)
* [392. Is Subsequence](https://hackmd.io/@Zero871015/LeetCode-392)
* [402. Remove K Digits](https://hackmd.io/@Zero871015/LeetCode-402)
* [406. Queue Reconstruction by Height](https://hackmd.io/@Zero871015/LeetCode-406)
* [451. Sort Characters By Frequency](https://hackmd.io/@Zero871015/LeetCode-451)
* [468. Validate IP Address](https://hackmd.io/@Zero871015/LeetCode-468)
* [476. Number Complement](https://hackmd.io/@Zero871015/LeetCode-476)
* [518. Coin Change 2](https://hackmd.io/@Zero871015/LeetCode-518)
* [525. Contiguous Array](https://hackmd.io/@Zero871015/LeetCode-525)
* [528. Random Pick with Weight](https://hackmd.io/@Zero871015/LeetCode-528)
* [540. Single Element in a Sorted Array](https://hackmd.io/@Zero871015/LeetCode-540)
* [543. Diameter of Binary Tree](https://hackmd.io/@Zero871015/LeetCode-543)
* [560. Subarray Sum Equals K](https://hackmd.io/@Zero871015/LeetCode-560)
* [678. Valid Parenthesis String](https://hackmd.io/@Zero871015/LeetCode-678)
* [700. Search in a Binary Search Tree](https://hackmd.io/@Zero871015/LeetCode-700)
* [724. Find Pivot Index](https://hackmd.io/@Zero871015/LeetCode-724)
* [733. Flood Fill](https://hackmd.io/@Zero871015/LeetCode-733)
* [766. Toeplitz Matrix](https://hackmd.io/@Zero871015/LeetCode-766)
* [771. Jewels and Stones](https://hackmd.io/@Zero871015/LeetCode-771)
* [844. Backspace String Compare](https://hackmd.io/@Zero871015/LeetCode-844)
* [876. Middle of the Linked List](https://hackmd.io/@Zero871015/LeetCode-876)
* [973. K Closest Points to Origin](https://hackmd.io/@Zero871015/LeetCode-973)
* [986. Interval List Intersections](https://hackmd.io/@Zero871015/LeetCode-986)
* [993. Cousins in Binary Tree](https://hackmd.io/@Zero871015/LeetCode-993)
* [997. Find the Town Judge](https://hackmd.io/@Zero871015/LeetCode-997)
* [1008. Construct Binary Search Tree from Preorder Traversal](https://hackmd.io/@Zero871015/LeetCode-1008)
* [1009. Complement of Base 10 Integer](https://hackmd.io/@Zero871015/LeetCode-1009)
* [1029. Two City Scheduling](https://hackmd.io/@Zero871015/LeetCode-1029)
* [1035. Uncrossed Lines](https://hackmd.io/@Zero871015/LeetCode-1035)
* [1046. Last Stone Weight](https://hackmd.io/@Zero871015/LeetCode-1046)
* [1137. N-th Tribonacci Number](https://hackmd.io/@Zero871015/LeetCode-1137)
* [1143. Longest Common Subsequence](https://hackmd.io/@Zero871015/LeetCode-1143)
* [1232. Check If It Is a Straight Line](https://hackmd.io/@Zero871015/LeetCode-1232)
* [1277. Count Square Submatrices with All Ones](https://hackmd.io/@Zero871015/LeetCode-1277)
* [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://hackmd.io/@Zero871015/LeetCode-1284)
* [1306. Jump Game III](https://hackmd.io/@Zero871015/LeetCode-1306)
* [1319. Number of Operations to Make Network Connected](https://hackmd.io/@Zero871015/LeetCode-1319)
* [1351. Count Negative Numbers in a Sorted Matrix](https://hackmd.io/@Zero871015/LeetCode-1351)
* [1370. Increasing Decreasing String](https://hackmd.io/@Zero871015/LeetCode-1370)
* [1402. Reducing Dishes](https://hackmd.io/@Zero871015/LeetCode-1402)
* [1408. String Matching in an Array](https://hackmd.io/@Zero871015/LeetCode-1408)
* [1480. Running Sum of 1d Array](https://hackmd.io/@Zero871015/LeetCode-1480)
* [1491. Average Salary Excluding the Minimum and Maximum Salary](https://hackmd.io/@Zero871015/LeetCode-1491)
* [1493. Longest Subarray of 1's After Deleting One Element](https://hackmd.io/@Zero871015/LeetCode-1493)
* [1512. Number of Good Pairs](https://hackmd.io/@Zero871015/LeetCode-1512)
* [1572. Matrix Diagonal Sum](https://hackmd.io/@Zero871015/LeetCode-1572)
* [1641. Count Sorted Vowel Strings](https://hackmd.io/@Zero871015/LeetCode-1641)
* [1669. Merge In Between Linked Lists](https://hackmd.io/@Zero871015/LeetCode-1669)
* [1759. Count Number of Homogenous Substrings](https://hackmd.io/@Zero871015/LeetCode-1759)
* [1768. Merge Strings Alternately](https://hackmd.io/@Zero871015/LeetCode-1768)
* [1822. Sign of the Product of an Array](https://hackmd.io/@Zero871015/LeetCode-1822)
* [1846. Maximum Element After Decreasing and Rearranging](https://hackmd.io/@Zero871015/LeetCode-1846)
* [1971. Find if Path Exists in Graph](https://hackmd.io/@Zero871015/LeetCode-1971)
* [2215. Find the Difference of Two Arrays](https://hackmd.io/@Zero871015/LeetCode-2215)
* [2405. Optimal Partition of String](https://hackmd.io/@Zero871015/LeetCode-2405)
* [2439. Minimize Maximum of Array](https://hackmd.io/@Zero871015/LeetCode-2439)
---

## 以下為沒有在Problems的題目

* 大多為活動、比賽中出現的題目。
* [Counting Elements](https://hackmd.io/@Zero871015/LeetCode-Other1)
* [Perform String Shifts](https://hackmd.io/@Zero871015/LeetCode-Other2)
* [Leftmost Column with at Least a One](https://hackmd.io/@Zero871015/LeetCode-Other3)
* [First Unique Number](https://hackmd.io/@Zero871015/LeetCode-Other4)
* [Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://hackmd.io/@Zero871015/LeetCode-Other5)

---
## Some Info
* 程式使用C++
* 我書讀得少，你不要嗆我
* 題號前有標註，代表明顯可以寫得更好，只是我累了
* 因 hackmd 改版，預設權限改變，如果有設定錯誤無法閱讀的網頁，可留言或用 mail 告知(mail 較快)，感謝
* Day: 04/28/19
* Last Update: 11/15/23
* Contact: [e-mail]
* Web: [Zerone](https://zero871015.github.io/)

###### tags: `LeetCode` `C++`