leetcode

KO | EN

gitlite — search

#golang #pdf #typescript #awesome #reactjs #markdown #cloud-native #gpt #devops #anthropic

(★ 104)

The Data Structures and Algorithms and LeetCode solutions

File Explorer

ZIP Download

- .gitignore
- CMakeLists.txt
- main.c
- - fft.cpp
  - fft_cp.cpp
- .gitignore
- CMakeLists.txt
- main.cpp
- README.md
- .gitignore
- - 1029. Two City Scheduling(Medium).md
  - 1091. Shortest Path in Binary Matrix(Medium).md
  - 11. Container With Most Water(Medium).md
  - 1137. N-th Tribonacci Number(Easy).md
  - 114. Flatten Binary Tree to Linked List(Medium).md
  - 117. Populating Next Right Pointers in Each Node II(Medium).md
  - 118. Pascal's Triangle(Medium).md
  - 120. Triangle(Medium).md
  - 1249. Minimum Remove to Make Valid Parentheses(Medium).md
  - 125. Valid Palindrome(Easy).md
  - 1302. Deepest Leaves Sum(Medium).md
  - 136. Single Number(Easy).md
  - 160. Intersection of Two Linked Lists(Easy).md
  - 1631. Path With Minimum Effort(Medium).md
  - 1641. Count Sorted Vowel Strings(Medium).md
  - 1642. Furthest Building You Can Reach(Medium).md
  - 1663. Smallest String With A Given Numeric Value(Medium).md
  - 167. Two Sum II - Input Array Is Sorted(Medium).md
  - 17. Letter Combinations of a Phone Number(Medium).md
  - 171. Excel Sheet Column Number(Easy).md
  - 1721. Swapping Nodes in a Linked List(Medium).md
  - 1780. Check if Number is a Sum of Powers of Three(Medium).md
  - 1834. Single-Threaded CPU(Medium).md
  - 19. Remove Nth Node From End of List(Medium).md
  - 191. Number of 1 Bits(Easy).md
  - 199. Binary Tree Right Side View(Medium).md
  - 2. Add Two Numbers(Medium).md
  - 200. Number of Islands(Medium).md
  - 21. Merge Two Sorted Lists(Easy).md
  - 215. Kth Largest Element in an Array(Medium).md
  - 216. Combination Sum III(Medium).md
  - 219. Contains Duplicate II(Easy).md
  - 2215. Find the Difference of Two Arrays(Easy).md
  - 240. Search a 2D Matrix II(Medium).md
  - 242. Valid Anagram(Easy).md
  - 2475. Number of Unequal Triplets in Array(Easy).md
  - 268. Missing Number(Easy).md
  - 278. First Bad Version(Easy).md
  - 287. Find the Duplicate Number(Medium).md
  - 29. Divide Two Integers(Medium).md
  - 295. Find Median from Data Stream(Medium).md
  - 3. Longest Substring Without Repeating Characters(Medium).md
  - 300. Longest Increasing Subsequence(Medium).md
  - 31. Next Permutation(Medium).md
  - 316. Remove Duplicate Letters(Medium).md
  - 322. Coin Change(Medium).md
  - 329. Longest Increasing Path in a Matrix(Hard).md
  - 334. Increasing Triplet Subsequence(Medium).md
  - 34. Find First and Last Position of Element in Sorted Array(Medium).md
  - 341. Flatten Nested List Iterator(Medium).md
  - 342. Power of Four(Easy).md
  - 344. Reverse String(Easy).md
  - 350. Intersection of Two Arrays II(Easy).md
  - 36. Valid Sudoku(Medium).md
  - 372. Super Pow(Medium).md
  - 377. Combination Sum IV(Medium).md
  - 378. Kth Smallest Element in a Sorted Matrix(Medium).md
  - 380. Insert Delete GetRandom O(1)(Medium).md
  - 39. Combination Sum(Medium).md
  - 399. Evaluate Division(Medium).md
  - 406. Queue Reconstruction by Height(Medium).md
  - 42. Trapping Rain Water(Hard).md
  - 429. N-ary Tree Level Order Traversal(Medium).md
  - 43. Multiply Strings(Medium).md
  - 440. K-th Smallest in Lexicographical Order(Hard).md
  - 456. 132 Pattern(Medium).md
  - 47. Permutations II(Medium).md
  - 5. Longest Palindromic Substring(Medium).md
  - 50. Pow(x, n)(Medium).md
  - 509. Fibonacci Number(Easy).md
  - 55. Jump Game(Medium).md
  - 617. Merge Two Binary Trees(Easy).md
  - 62. Unique Paths(Medium).md
  - 658. Find K Closest Elements(Medium).md
  - 680. Valid Palindrome II(Easy).md
  - 69. Sqrt(x)(Easy).md
  - 692. Top K Frequent Words(Medium).md
  - 70. Climbing Stairs(Easy).md
  - 71. Simplify Path(Medium).md
  - 729. My Calendar I(Medium).md
  - 74. Search a 2D Matrix(Medium).md
  - 746. Min Cost Climbing Stairs(Easy).md
  - 763. Partition Labels(Medium).md
  - 81. Search in Rotated Sorted Array II(Medium).md
  - 856. Score of Parentheses(Medium).md
  - 858. Mirror Reflection(Medium).md
  - 88. Merge Sorted Array(Easy).md
  - 88. Merge Sorted Arrays(Easy).md
  - 881. Boats to Save People(Medium).md
  - 895. Maximum Frequency Stack(Hard).md
  - 907. Sum of Subarray Minimums(Medium).md
  - 923. 3Sum With Multiplicity(Medium).md
  - 94. Binary Tree Inorder Traversal(Easy).md
  - 946. Validate Stack Sequences(Medium).md
  - 947. Most Stones Removed with Same Row or Column(Medium).md
  - 98. Validate Binary Search Tree(Medium).md
  - 991. Broken Calculator(Medium).md
  - My Leetcode Solutions All In One.md
- 441. 排列硬币(Easy).md
.gitignore
LICENSE
README.md

# Use via CDN

jsDelivr

jsDelivr serves any public GitHub repository as a CDN with zero setup. Pick a version and a file to get a ready-to-paste link and snippet.

Version

File

Link

Example

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
| No. | Problems | Difficulty | Source Code | Solution |
|---- |----------|------------|-------------|----------|
| 001 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem1_twoSum.java) | [2种方法：暴力 和 HashMap](http://www.longluo.me/blog/2019/03/25/Leetcode-two-sum/) |
| 002 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem2_addTwoNumbers.java) | [2种方法：模拟 和 递归](http://www.longluo.me/blog/2019/03/26/Leetcode-add-two-numbers/) |
| 003 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem3_longestSubstringWithoutRepeatingCharacters.java) |  |
| 004 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem4_findMedianSortedArrays.java) | [4种方法：合并数组，暴力法，二分搜索，划分数组](http://www.longluo.me/blog/2021/02/17/Leetcode-median-of-two-sorted-arrays/) |
| 005 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem5_longestPalindromeString.java) |  |
| 010 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem10_regularExpressionMatching.java) |  |
| 011 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem11_containerWithMostWater.java) | [2 Approaches: BF and Two Pointers with Image Explaination](http://www.longluo.me/blog/2022/04/05/Leetcode-container-with-most-water/) |
| 015 | [3Sum](https://leetcode.com/problems/3sum/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem15_3Sum.java) | [3种方法：暴力，Hash，双指针](http://www.longluo.me/blog/2021/02/05/Leetcode-three-sum/) |
| 017 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem17_letterCombinationsOfAPhoneNumber.java) | [4 Approaches: BF 4 Loops, Backtracking, BFS, Queue with Image Explaination](http://www.longluo.me/blog/2022/05/09/Leetcode-letter-combinations-of-a-phone-number/) |
| 019 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem19_removeNthNodeFromEndOfList.java) |  |
| 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem20_validParentheses.java) |  |
| 021 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem21_mergeTwoSortedList.java) |  |
| 022 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem22_generateParenthesis.java) | [2种方法：暴力法 和 回溯法](http://www.longluo.me/blog/2020/11/11/Leetcode-generate-parenthesis/) |
| 023 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem23_mergeKSortedLists.java) |  |
| 024 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem24_swapNodesInPairs.java) |  |
| 025 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) |Hard| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem25_reverseNodesInKGroup.java) |  |
| 031 | [Next Permutation](https://leetcode.com/problems/next-permutation/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem31_nextPermutation.java) | [Two Pointers Solution with Detailed Explanation and Code Commented](http://www.longluo.me/blog/2022/04/03/Leetcode-next-permutation/) |
| 032 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem32_longestValidParentheses.java) |  |
| 033 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem33_searchInRotatedSortedArray.java) |  |
| 034 | [Search for a Range](https://leetcode.com/problems/search-for-a-range/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem34_findFirstAndLastPositionOfElementInSortedArray.java) |  |
| 035 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem35_searchInsertPosition.java) |  |
| 039 | [Combination Sum](https://leetcode.com/problems/combination-sum/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem39_combinationSum.java) |  |
| 042 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem42_trappingRainWater.java) |  |
| 045 | [Jump Game II](https://leetcode-cn.com/problems/jump-game-ii/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem45_jumpGame_ii.java) |  |
| 046 | [Permutations](https://leetcode.com/problems/permutations/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem46_permutations.java) |  |
| 048 | [Rotate Image](https://leetcode.com/problems/rotate-image/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem48_rotateImage.java) |  |
| 049 | [Group Anagrams](https://leetcode.com/problems/anagrams/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem49_groupAnagrams.java) |  |
| 053 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem53_maximumSubarray.java) |  |
| 055 | [Jump Game](https://leetcode.com/problems/jump-game/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem55_jumpGame.java) |  |
| 056 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem56_mergeIntervals.java) |  |
| 062 | [Unique Paths](https://leetcode.com/problems/unique-paths/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem62_uniquePaths.java) |  |
| 064 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem64_minimumPathSum.java) |  |
| 070 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem70_climbingStairs.java) |  |
| 072 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem72_editDistance.java) |  |
| 075 | [Sort Colors](https://leetcode.com/problems/sort-colors/)|Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem75_sortColors.java) |  |
| 076 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem76_minimumWindowSubstring.java) |  |
| 078 | [Subsets](https://leetcode.com/problems/subsets/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem78_subsets.java) |  |
| 079 | [Word Search](https://leetcode.com/problems/word-search/)|Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem79_wordSearch.java) |  |
| 084 | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem84_largestRectangleInHistogram.java) |  |
| 085 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem85_maximalRectangle.java) |  |
| 094 | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem94_binaryTreeInorderTraversal.java) |  |
| 096 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem96_uniqueBinarySearchTrees.java) |  |
| 098 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem98_validateBinarySearchTree.java) |  |
| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem101_symmetricTree.java) |  |
| 102 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem102_binaryTreeLevelOrderTraversal.java) |  |
| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem104_maximumDepthOfBinaryTree.java) |  |
| 105 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem105_constructBinaryTreeFromPreorderAndInorderTraversal.java) |  |
| 114 | [Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem114_flattenBinaryTreeToLinkedList.java) |  |
| 121 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem121_bestTimeToBuyAndSellStock.java) |  |
| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem128_longestConsecutiveSequence.java) |  |
| 136 | [Single Number](https://leetcode.com/problems/single-number) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem136_singleNumber.java) |  |
| 139 | [Word Break](https://leetcode.com/problems/word-break/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem139_wordBreak.java) |  |
| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem141_linkedListCycle.java) |  |
| 142 | [Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem142_linkedListCycle_ii.java) |  |
| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem146_lruCache.java) |  |
| 148 | [Sort List](https://leetcode.com/problems/sort-list/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem148_sortList.java) |  |
| 152 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem152_maximumProductSubarray.java) |  |
| 155 | [Min Stack](https://leetcode.com/problems/min-stack/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem155_minStack.java) | [3种方法：辅助栈，栈，链表](http://www.longluo.me/blog/2021/02/23/Leetcode-min-stack/) |
| 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem160_intersectionOfTwoLinkedLists.java) |  |
| 169 | [Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem169_majorityElement.java) |  |
| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem198_houseRobber.java) |  |
| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem200_numberOfIslands.java) |  |
| 206 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem206_reverseLinkedList.java) |  |
| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem207_courseSchedule.java) |  |
| 208 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem208_implementTriePrefixTree.java) |  |
| 210 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem210_findOrder.java) |  |
| 215 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem215_kthLargestElementInAnArray.java) |  |
| 221 | [Maximal Square](https://leetcode.com/problems/maximal-square/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem221_maximalSquare.java) |  |
| 226 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem226_invertBinaryTree.java) |  |
| 230 | [Kth Smallest Element in a BST](https://leetcode.com/problems/invert-binary-tree/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem230_kthSmallestElementInABst.java) |  |
| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem234_palindromeLinkedList.java) |  |
| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem238_productOfArrayExceptSelf.java) |  |
| 239 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem239_slidingWindowMaximum.java) |  |
| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem240_searcha2DMatrix_ii.java) |  |
| 253 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii) |Medium| 没权限  |  |
| 279 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem279_perfectSquares.java) |  |
| 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/)| Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem283_moveZeroes.java) |  |
| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem287_findTheDuplicateNumber.java) | [9 Approaches: Count, Hash, Sort, Binary Search, Bit, Fast Slow Pointers](http://www.longluo.me/blog/2022/02/18/Leetcode-find-the-duplicate-number/) |
| 297 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem297_serializeAndDeserializeBinaryTree.java)  |  |
| 300 | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem300_longestIncreasingSubsequence.java) |  |
| 301 | [Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/) |Hard| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem301_removeInvalidParentheses.java) |  |
| 309 | [Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem309_bestTimeToBuyAndSellStockWithCooldown.java)  |  |
| 312 | [Burst Balloons](https://leetcode.com/problems/burst-balloons/) | Hard | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem312_burstBalloons.java) |  |
| 322 | [Coin Change](https://leetcode.com/problems/coin-change/)|Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem322_coinChange.java) |  |
| 328 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)|Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem328_oddEvenLinkedList.java) |  |
| 337 | [House Robber III](https://leetcode.com/problems/house-robber-iii/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem337_houseRobber_iii.java) |  |
| 338 | [Counting Bits](https://leetcode.com/problems/counting-bits/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem338_countBits.java) |  |
| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem347_topKFrequentElements.java) |  |
| 394 | [Decode String](https://leetcode.com/problems/decode-string/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem394_decodeString.java) |  |
| 399 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem399_evaluateDivision.java) |  |
| 406 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem406_queueReconstructionByHeight.java) |  |
| 416 | [Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem416_partitionEqualSubsetSum.java) |  |
| 437 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem437_pathSum_iii.java) |  |
| 438 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | Easy |[Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem438_findAllAnagramsInAString.java) | [滑动窗口：从HashMap，数组，再到统计字母数量之差](http://www.longluo.me/blog/2021/11/28/Leetcode-find-all-anagrams-in-a-string/) |
| 448 | [Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem448_findAllNumbersDisappearedInAnArray.java) |  |
| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem461_hammingDistance.java) |  |
| 494 | [Target Sum](https://leetcode.com/problems/target-sum/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem494_targetSum.java) |  |
| 538 | [Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem538_convertBSTToGreaterTree.java) |  |
| 543 | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem543_diameterOfBinaryTree.java) |  |
| 560 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem560_subarraySumEqualsK.java) |  |
| 572 | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem572_subtreeOfAnotherTree.java) |  |
| 581 | [Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem581_shortestUnsortedContinuousSubarray.java) |  |
| 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem617_mergeTwoBinaryTrees.java) | [ 4 Approaches: Recursion, Iteration, BFS and DFS](http://www.longluo.me/blog/2022/04/12/Leetcode-merge-two-binary-trees/) |
| 621 | [Task Scheduler](https://leetcode.com/problems/task-scheduler) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem621_taskScheduler.java) |  |
| 647 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem647_palindromicSubstrings.java) |  |
| 739 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem739_dailyTemperatures.java) |  |
| 763 | [Partition Labels](https://leetcode.com/problems/partition-labels/) |Medium| [Java](https://github.com/longluo/leetcode/blob/master/Java/src/com/longluo/top100/Problem763_partitionLabels.java) | [Illustration of the Max Position of the Char in the Partition with Easy Detailed Explanation](http://www.longluo.me/blog/2022/03/21/Leetcode-Partition-Labels) |

## [LeetCode Problems List](https://github.com/longluo/leetcode/wiki/LeetCode-Problems-List)

## [LeetCode Top 100 Liked Questions](https://github.com/longluo/leetcode/wiki/LeetCode-Top-100-Liked-Questions)

## [Python Algorithms Cheatsheet](https://github.com/longluo/leetcode/wiki/Python-Algorithms-Cheatsheet)

-------------------

[我的Leetcode的解题](http://www.longluo.me/blog/2020/12/09/Leetcode-Solutions/)
[《剑指Offer》刷题记录](http://www.longluo.me/blog/2020/12/20/Coding-Interviews/)

Welcome to [My Website](https://www.longluo.me)

leetcode

Owner Repos

File Explorer

# Use via CDN

Was this content helpful?

Recent Feedback

leetcode

Owner Repos

File Explorer

# Use via CDN

Was this content helpful?

Recent Feedback

Download README