# leetcode_tags **Repository Path**: hugh_sun/leetcode_tags ## Basic Information - **Project Name**: leetcode_tags - **Description**: leetcode by tags - **Primary Language**: Java - **License**: MIT - **Default Branch**: master - **Homepage**: None - **GVP Project**: No ## Statistics - **Stars**: 0 - **Forks**: 0 - **Created**: 2019-10-25 - **Last Updated**: 2020-12-19 ## Categories & Tags **Categories**: Uncategorized **Tags**: None ## README # Leetcode Leetcode solution
## Array   [1. Two Sum.md](./Array/easy/1.%20Two%20Sum.md) [easy]
  [15. 3Sum.md](./Array/medium/15.%203Sum.md) [medium]
  [16. 3Sum Closest.md](./Array/medium/16.%203Sum%20Closest.md) [medium]
  [18. 4Sum.md](./Array/medium/18.%204Sum.md) [medium]
  [26. Remove Duplicates from Sorted Array.md](./Array/easy/26.%20Remove%20Duplicates%20from%20Sorted%20Array.md) [easy]
  [27. Remove Element.md](./Array/easy/27.%20Remove%20Element.md) [easy]
  [31. Next Permutation.md](./Array/medium/31.%20Next%20Permutation.md) [medium]
  [33. Search in Rotated Sorted Array.md](./Array/medium/33.%20Search%20in%20Rotated%20Sorted%20Array.md) [medium]
  [34. Find First and Last Position of Element in Sorted Array.md](./Array/medium/34.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md) [medium]
  [35. Search Insert Position.md](./Array/easy/35.%20Search%20Insert%20Position.md) [easy]
  [39. Combination Sum.md](./Array/medium/39.%20Combination%20Sum.md) [medium]
  [40. Combination Sum II.md](./Array/medium/40.%20Combination%20Sum%20II.md) [medium]
  [42. Trapping Rain Water.md](./Array/hard/42.%20Trapping%20Rain%20Water.md) [hard]
  [53. Maximum Subarray.md](./Array/easy/53.%20Maximum%20Subarray.md) [easy]
  [56. Merge Intervals.md](./Array/medium/56.%20Merge%20Intervals.md) [medium]
  [57. Insert Interval.md](./Array/hard/57.%20Insert%20Interval.md) [hard]
  [59. Spiral Matrix II.md](./Array/medium/59.%20Spiral%20Matrix%20II.md) [medium]
  [62. Unique Paths.md](./Array/medium/62.%20Unique%20Paths.md) [medium]
  [63. Unique Paths II.md](./Array/medium/63.%20Unique%20Paths%20II.md) [medium]
  [64. Minimum Path Sum.md](./Array/medium/64.%20Minimum%20Path%20Sum.md) [medium]
  [66. Plus One.md](./Array/easy/66.%20Plus%20One.md) [easy]
  [73. Set Matrix Zeroes.md](./Array/medium/73.%20Set%20Matrix%20Zeroes.md) [medium]
  [74. Search a 2D Matrix.md](./Array/medium/74.%20Search%20a%202D%20Matrix.md) [medium]
  [78. Subsets.md](./Array/medium/78.%20Subsets.md) [medium]
  [80. Remove Duplicates from Sorted Array II.md](./Array/medium/80.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md) [medium]
  [88. Merge Sorted Array.md](./Array/easy/88.%20Merge%20Sorted%20Array.md) [easy]
  [118. Pascal's Triangle.md](./Array/easy/118.%20Pascal%27s%20Triangle.md) [easy]
  [119. Pascal's Triangle II.md](./Array/easy/119.%20Pascal%27s%20Triangle%20II.md) [easy]
  [121. Best Time to Buy and Sell Stock.md](./Array/easy/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md) [easy]
  [122. Best Time to Buy and Sell Stock II.md](./Array/easy/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md) [easy]
  [130. Surrounded Regions.md](./Array/medium/130.%20Surrounded%20Regions.md) [medium]
  [134. Gas Station.md](./Array/medium/134.%20Gas%20Station.md) [medium]
  [152. Maximum Product Subarray.md](./Array/medium/152.%20Maximum%20Product%20Subarray.md) [medium]
  [167. Two Sum II - Input array is sorted.md](./Array/easy/167.%20Two%20Sum%20II%20-%20Input%20array%20is%20sorted.md) [easy]
  [169. Majority Element.md](./Array/easy/169.%20Majority%20Element.md) [easy]
  [179. Largest Number.md](./Array/medium/179.%20Largest%20Number.md) [medium]
  [189. Rotate Array.md](./Array/easy/189.%20Rotate%20Array.md) [easy]
  [209. Minimum Size Subarray Sum.md](./Array/medium/209.%20Minimum%20Size%20Subarray%20Sum.md) [medium]
  [217. Contains Duplicate.md](./Array/easy/217.%20Contains%20Duplicate.md) [easy]
  [219. Contains Duplicate II.md](./Array/easy/219.%20Contains%20Duplicate%20II.md) [easy]
  [228. Summary Ranges.md](./Array/medium/228.%20Summary%20Ranges.md) [medium]
  [229. Majority Element II.md](./Array/medium/229.%20Majority%20Element%20II.md) [medium]
  [238. Product of Array Except Self.md](./Array/medium/238.%20Product%20of%20Array%20Except%20Self.md) [medium]
  [268. Missing Number.md](./Array/easy/268.%20Missing%20Number.md) [easy]
  [278. First Bad Version.md](./Array/easy/278.%20First%20Bad%20Version.md) [easy]
  [283. Move Zeroes.md](./Array/easy/283.%20Move%20Zeroes.md) [easy]
  [287. Find the Duplicate Number.md](./Array/medium/287.%20Find%20the%20Duplicate%20Number.md) [medium]
  [658. Find K Closest Elements.md](./Array/medium/658.%20Find%20K%20Closest%20Elements.md) [medium]
  [1217. Play with Chips.md](./Array/easy/1217.%20Play%20with%20Chips.md) [easy]
  [1252. Cells with Odd Values in a Matrix.md](./Array/easy/1252.%20Cells%20with%20Odd%20Values%20in%20a%20Matrix.md) [easy]
  [1260. Shift 2D Grid.md](./Array/easy/1260.%20Shift%202D%20Grid.md) [easy]
## HashTable   [1. Two Sum.md](./HashTable/easy/1.%20Two%20Sum.md) [easy]
  [3. Longest Substring Without Repeating Characters.md](./HashTable/medium/3.%20Longest%20Substring%20Without%20Repeating%20Characters.md) [medium]
  [202. Happy Number.md](./HashTable/easy/202.%20Happy%20Number.md) [easy]
  [204. Count Primes.md](./HashTable/easy/204.%20Count%20Primes.md) [easy]
  [205. Isomorphic Strings.md](./HashTable/easy/205.%20Isomorphic%20Strings.md) [easy]
## LinkedList   [2. Add Two Numbers.md](./LinkedList/medium/2.%20Add%20Two%20Numbers.md) [medium]
  [19. Remove Nth Node From End of List.md](./LinkedList/medium/19.%20Remove%20Nth%20Node%20From%20End%20of%20List.md) [medium]
  [23. Merge k Sorted Lists.md](./LinkedList/hard/23.%20Merge%20k%20Sorted%20Lists.md) [hard]
  [25. Reverse Nodes in k-Group.md](./LinkedList/hard/25.%20Reverse%20Nodes%20in%20k-Group.md) [hard]
  [61. Rotate List.md](./LinkedList/medium/61.%20Rotate%20List.md) [medium]
  [86. Partition List.md](./LinkedList/medium/86.%20Partition%20List.md) [medium]
  [109. Convert Sorted List to Binary Search Tree.md](./LinkedList/medium/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md) [medium]
  [133. Clone Graph.md](./LinkedList/medium/133.%20Clone%20Graph.md) [medium]
  [138. Copy List with Random Pointer.md](./LinkedList/medium/138.%20Copy%20List%20with%20Random%20Pointer.md) [medium]
  [142. Linked List Cycle II.md](./LinkedList/medium/142.%20Linked%20List%20Cycle%20II.md) [medium]
  [143. Reorder List.md](./LinkedList/medium/143.%20Reorder%20List.md) [medium]
  [147. Insertion Sort List.md](./LinkedList/medium/147.%20Insertion%20Sort%20List.md) [medium]
  [148. Sort List.md](./LinkedList/medium/148.%20Sort%20List.md) [medium]
  [445. Add Two Numbers II.md](./LinkedList/medium/445.%20Add%20Two%20Numbers%20II.md) [medium]
  [725. Split Linked List in Parts.md](./LinkedList/medium/725.%20Split%20Linked%20List%20in%20Parts.md) [medium]
  [1237. Find Positive Integer Solution for a Given Equation.md](./LinkedList/easy/1237.%20Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation.md) [easy]
## String   [131. Palindrome Partitioning.md](./String/medium/131.%20Palindrome%20Partitioning.md) [medium]
  [1221. Split a String in Balanced Strings.md](./String/easy/1221.%20Split%20a%20String%20in%20Balanced%20Strings.md) [easy]