# LeetCode-Solutions

**Repository Path**: wonz/LeetCode-Solutions

## Basic Information

- **Project Name**: LeetCode-Solutions
- **Description**: :green_heart:My own LeetCode solutions
- **Primary Language**: Python
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-08-21
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

# LeetCode-Solutions
### :green_heart:My own LeetCode solutions

| No.  | Problem                           | LeetCode                                               | 力扣                                                 | Python                                                       | Go   | Solution                                                    | Difficulty | Tag |
| ---- | ---------------------------------- | ------------------------------------------------------------ | ------------------------------------------------------------ | ------------------------------------------------------------ | ---- | ------------------------------------------------------------ | ----- | --------- |
| 0017 | Letter Combinations of a Phone Number | [LeetCode](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [力扣](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/submissions/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0017-Letter-Combinations-of-a-Phone-Number/0017.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104662602) | Medium | 回溯、暴力 |
| 0034 | Find First and Last Position of Element in Sorted Array | [LeetCode](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [力扣](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0034-Find-First-and-Last-Position-of-Element-in-Sorted-Array/0034.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104454711) | Medium | 二分 |
| 0039 | Combination Sum | [LeetCode](https://leetcode.com/problems/combination-sum/description/) | [力扣](https://leetcode-cn.com/problems/combination-sum/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0039-Combination-Sum/0039.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104713477) | Medium | 回溯 |
| 0046 | Permutations | [LeetCode](https://leetcode.com/problems/permutations/) | [力扣](https://leetcode-cn.com/problems/permutations/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0046-Permutations/0046.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104665174) | Medium | 回溯 |
| 0047 | Permutations II | [LeetCode](https://leetcode.com/problems/permutations-ii/) | [力扣](https://leetcode-cn.com/problems/permutations-ii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0047-Permutations-II/0047.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104684215) | Medium | 递归、回溯 |
| 0053 | Maximum Subarray | [LeetCode](https://leetcode.com/problems/maximum-subarray/) | [力扣](https://leetcode-cn.com/problems/maximum-subarray/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0053-Maximum-Subarray/0053.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104430145) | Easy | 动态规划 |
| 0069 | Sqrt(x) | [LeetCode](https://leetcode.com/problems/sqrtx/) | [力扣](https://leetcode-cn.com/problems/sqrtx/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0069-Sqrt-x/0069.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104445312) | Easy | 二分、牛顿迭代 |
| 0070 | Climbing Stairs | [LeetCode](https://leetcode.com/problems/climbing-stairs/) | [力扣](https://leetcode-cn.com/problems/climbing-stairs/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0070-Climbing-Stairs/0070.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105149396) | Easy | 动态规划 |
| 0075 | Sort Colors | [LeetCode](https://leetcode.com/problems/sort-colors/) | [力扣](https://leetcode-cn.com/problems/sort-colors/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0075-Sort-Colors/0075.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104332975) | Medium | 荷兰旗 |
| 0077 | Combinations | [LeetCode](https://leetcode.com/problems/combinations/) | [力扣](https://leetcode-cn.com/problems/combinations/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0077-Combinations/0077.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104685724) | Medium | 回溯 |
| 0079 | Word Search | [LeetCode](https://leetcode.com/problems/word-search/) | [力扣](https://leetcode-cn.com/problems/word-search/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0079-Word-Search/0079.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104663556) | Medium | 回溯 |
| 0088 | Merge Sorted Array | [LeetCode](https://leetcode.com/problems/merge-sorted-array/) | [力扣](https://leetcode-cn.com/problems/merge-sorted-array/submissions/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0088-Merge-Sorted-Array/0088.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104288724) | Easy | 双指针 |
| 0093 | Restore IP Addresses | [LeetCode](https://leetcode.com/problems/restore-ip-addresses/) | [力扣](https://leetcode-cn.com/problems/restore-ip-addresses/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0093-Restore-IP-Addresses/0093.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104662059) | Medium | 回溯、暴力 |
| 0095 | Unique Binary Search Trees II | [LeetCode](https://leetcode.com/problems/unique-binary-search-trees-ii/) | [力扣](https://leetcode-cn.com/problems/unique-binary-search-trees-ii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0095-Unique-Binary-Search-Trees-II/0095.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104518007) | Medium | 分治、DFS |
| 0102 | Binary Tree Level Order Traversal | [LeetCode](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [力扣](https://leetcode-cn.com/problems/binary-tree-level-order-traversal/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0102-Binary-Tree-Level-Order-Traversal/0102.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105001349) | Medium | 二叉树、BFS |
| 0105 | Construct Binary Tree from Preorder and Inorder Traversal | [LeetCode](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [力扣](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0105-Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/0105.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104952777) | Medium | 二叉树、递归 |
| 0106 | Construct Binary Tree from Inorder and Postorder Traversal | [LeetCode](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [力扣](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0106-Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/0106.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104953562) | Medium | 二叉树、递归 |
| 0113 | Path Sum II | [LeetCode](https://leetcode.com/problems/path-sum-ii/) | [力扣](https://leetcode-cn.com/problems/path-sum-ii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0113-Path-Sum-II/0113.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105061186) | Medium | 回溯 |
| 0121 | Best Time to Buy and Sell Stock | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0121-Best-Time-to-Buy-and-Sell-Stock/0121.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104402622) | Easy | 贪心 |
| 0122 | Best Time to Buy and Sell Stock II | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0122-Best-Time-to-Buy-and-Sell-Stock-II/0122.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104405384) | Easy | 贪心 |
| 0123 | Best Time to Buy and Sell Stock III | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0123-Best-Time-to-Buy-and-Sell-Stock-III/0123.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104807010) | Hard | 动态规划 |
| 0127 | Word Ladder | [LeetCode](https://leetcode.com/problems/word-ladder/) | [力扣](https://leetcode-cn.com/problems/word-ladder/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0127-Word-Ladder/0127.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104565467) | Medium | BFS |
| 0130 | Surrounded Regions | [LeetCode](https://leetcode.com/problems/surrounded-regions/) | [力扣](https://leetcode-cn.com/problems/surrounded-regions/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0130-Surrounded-Regions/0130.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104575237) | Medium | DFS |
| 0141 | Linked List Cycle | [LeetCode](https://leetcode.com/problems/linked-list-cycle/) | [力扣](https://leetcode-cn.com/problems/linked-list-cycle/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0141-Linked-List-Cycle/0141.py) |  | [CSDN](https://wonzwang.blog.csdn.net/article/details/104292882) | Easy | 双指针 |
| 0153 | Find Minimum in Rotated Sorted Array | [LeetCode](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [力扣](https://leetcode-cn.com/problems/find-minimum-in-rotated-sorted-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104451433) | Medium | 二分 |
| 0167 | Two Sum II - Input array is sorted | [LeetCode](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [力扣](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0167-Two-Sum-II-Input-array-is-sorted/0167.py) |      | [CSDN](https://wonzwang.blog.csdn.net/article/details/104271994) | Easy  | 双指针    |
| 0169 |  |  |  |  | |  |  |  |
| 0188 | Best Time to Buy and Sell Stock IV | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-iv/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0188-Best-Time-to-Buy-and-Sell-Stock-IV/0188.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104808307) | Hard | 动态规划 |
| 0200 | Number of Islands | [LeetCode](https://leetcode.com/problems/number-of-islands/) | [力扣](https://leetcode-cn.com/problems/number-of-islands/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0200-Number-of-Islands/0200.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104566790) | Medium | DFS |
| 0206 | Reverse Linked List | [LeetCode](https://leetcode.com/problems/reverse-linked-list/) | [力扣](https://leetcode-cn.com/problems/reverse-linked-list/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0206-Reverse-Linked-List/0206.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104613515) | Easy | 链表 |
| 0215 | Kth Largest Element in an Array | [LeetCode](https://leetcode.com/problems/kth-largest-element-in-an-array/) | [力扣](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0215-Kth-Largest-Element-in-an-Array/0215.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104319941) | Medium | 快排、堆 |
| 0225 | Implement Stack using Queues | [LeetCode](https://leetcode.com/problems/implement-stack-using-queues/) | [力扣](https://leetcode-cn.com/problems/implement-stack-using-queues/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0225-Implement-Stack-using-Queues/0225.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104602519) | Easy | 栈、队列 |
| 0226 | Invert Binary Tree | [LeetCode](https://leetcode.com/problems/invert-binary-tree/) | [力扣](https://leetcode-cn.com/problems/invert-binary-tree/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0226-Invert-Binary-Tree/0226.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104978148) | Easy | 二叉树、递归 |
| 0240 | Search a 2D Matrix II | [LeetCode](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [力扣](https://leetcode-cn.com/problems/search-a-2d-matrix-ii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0240-Search-a-2D-Matrix-II/0240.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104931011) | Medium | 数组 |
| 0241 | Different Ways to Add Parentheses | [LeetCode](https://leetcode.com/problems/different-ways-to-add-parentheses/) | [力扣](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0241-Different-Ways-to-Add-Parentheses/0241.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104496806) | Medium | 分治 |
| 0257 | Binary Tree Paths | [LeetCode](https://leetcode.com/problems/binary-tree-paths/) | [力扣](https://leetcode-cn.com/problems/binary-tree-paths/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0257-Binary-Tree-Paths/0257.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104622561) | Easy | DFS |
| 0278 | First Bad Version | [LeetCode](https://leetcode.com/problems/first-bad-version/) | [力扣](https://leetcode-cn.com/problems/first-bad-version/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0278-First-Bad-Version/0278.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104450409) | Easy | 二分 |
| 0279 | Perfect Squares | [LeetCode](https://leetcode.com/problems/perfect-squares/) | [力扣](https://leetcode-cn.com/problems/perfect-squares/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0279-Perfect-Squares/0279.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104527266) | Medium | BFS、动态规划 |
| 0300 |  |  |  |  | |  |  |  |
| 0309 | Best Time to Buy and Sell Stock with Cooldown | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0309-Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/0309.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104805193) | Medium | 动态规划 |
| 0322 |  |  |  |  | |  |  |  |
| 0345 | Reverse Vowels of a String         | [LeetCode](https://leetcode.com/problems/reverse-vowels-of-a-string/) | [力扣](https://leetcode-cn.com/problems/reverse-vowels-of-a-string/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0345-Reverse-Vowels-of-a-String/0345.py) |      | [CSDN](https://wonzwang.blog.csdn.net/article/details/104269137) | Easy  | 双指针    |
| 0347 | Top K Frequent Elements | [LeetCode](https://leetcode.com/problems/top-k-frequent-elements/) | [力扣](https://leetcode-cn.com/problems/top-k-frequent-elements/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0347-Top-K-Frequent-Elements/0347.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104321237) | Medium | 桶排序 |
| 0365 | Water and Jug Problem | [LeetCode](https://leetcode.com/problems/water-and-jug-problem/) | [力扣](https://leetcode-cn.com/problems/water-and-jug-problem/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0365-Water-and-Jug-Problem/0365.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105017080) | Medium | BFS、数学 |
| 0392 | Is Subsequence | [LeetCode](https://leetcode.com/problems/is-subsequence/) | [力扣](https://leetcode-cn.com/problems/is-subsequence/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0392-Is-Subsequence/0392.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104408642) | Easy | 双指针 |
| 0406 | Queue Reconstruction by Height | [LeetCode](https://leetcode.com/problems/queue-reconstruction-by-height/) | [力扣](https://leetcode-cn.com/problems/queue-reconstruction-by-height/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0406-Queue-Reconstruction-by-Height/0406.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104349766) | Medium | 贪心 |
| 0409 | Longest Palindrome | [LeetCode](https://leetcode.com/problems/longest-palindrome/) | [力扣](https://leetcode-cn.com/problems/longest-palindrome/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0409-Longest-Palindrome/0409.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104976636) | Easy | 字符串 |
| 0417 | Pacific Atlantic Water Flow | [LeetCode](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [力扣](https://leetcode-cn.com/problems/pacific-atlantic-water-flow/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0417-Pacific-Atlantic-Water-Flow/0417.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104579445) | Medium | DFS |
| 0435 | Non-overlapping Intervals | [LeetCode](https://leetcode.com/problems/non-overlapping-intervals/) | [力扣](https://leetcode-cn.com/problems/non-overlapping-intervals/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0435-Non-overlapping-Intervals/0435.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104348616) | Medium | 区间贪心 |
| 0451 | Sort Characters By Frequency | [LeetCode](https://leetcode.com/problems/sort-characters-by-frequency/submissions/) | [力扣](https://leetcode-cn.com/problems/sort-characters-by-frequency/submissions/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0451-Sort-Characters-By-Frequency/0451.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104330167) | Medium | 桶排序 |
| 0452 | Minimum Number of Arrows to Burst Balloons | [LeetCode](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [力扣](https://leetcode-cn.com/problems/minimum-number-of-arrows-to-burst-balloons/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0452-Minimum-Number-of-Arrows-to-Burst-Balloons/0452.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104347754) | Medium | 区间贪心 |
| 0455 | Assign Cookies | [LeetCode](https://leetcode.com/problems/assign-cookies/) | [力扣](https://leetcode-cn.com/problems/assign-cookies/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0455-Assign-Cookies/0455.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104333506) | Easy | 贪心 |
| 0509 | Fibonacci Number | [LeetCode](https://leetcode.com/problems/fibonacci-number/) | [力扣](https://leetcode-cn.com/problems/fibonacci-number/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0509-Fibonacci-Number/0509.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105149103) | Easy | 动态规划 |
| 0524 | Longest Word in Dictionary through Deleting | [LeetCode](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/) | [力扣](https://leetcode-cn.com/problems/longest-word-in-dictionary-through-deleting/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0524-Longest-Word-in-Dictionary-through-Deleting/0524.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104314325) | Medium | 双指针 |
| 0540 | Single Element in a Sorted Array | [LeetCode](https://leetcode.com/problems/single-element-in-a-sorted-array/) | [力扣](https://leetcode-cn.com/problems/single-element-in-a-sorted-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0540-Single-Element-in-a-Sorted-Array/0540.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104449480) | Medium | 二分 |
| 0547 | Friend Circles | [LeetCode](https://leetcode.com/problems/friend-circles/) | [力扣](https://leetcode-cn.com/problems/friend-circles/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0547-Friend-Circles/0547.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104574139) | Medium | DFS |
| 0605 | Can Place Flowers | [LeetCode](https://leetcode.com/problems/can-place-flowers/) | [力扣](https://leetcode-cn.com/problems/can-place-flowers/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0605-Can-Place-Flowers/0605.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104406673) | Easy | 贪心 |
| 0633 | Sum of Square Numbers              | [LeetCode](https://leetcode.com/problems/sum-of-square-numbers) | [力扣](https://leetcode-cn.com/problems/sum-of-square-numbers/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0633-Sum-of-Square-Numbers/0633.py) |      | [CSDN](https://wonzwang.blog.csdn.net/article/details/104274301) | Easy  | 双指针    |
| 0665 | Non-decreasing Array | [LeetCode](https://leetcode.com/problems/non-decreasing-array/) | [力扣](https://leetcode-cn.com/problems/non-decreasing-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0665-Non-decreasing-Array/0665.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104411132) | Easy | 贪心 |
| 0680 | Valid Palindrome II | [LeetCode](https://leetcode.com/problems/valid-palindrome-ii/) | [力扣](https://leetcode-cn.com/problems/valid-palindrome-ii/submissions/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0680-Valid-Palindrome-II/0680.py) |      | [CSDN](https://wonzwang.blog.csdn.net/article/details/104284572) | Easy | 双指针 |
| 0695 | Max Area of Island | [LeetCode](https://leetcode.com/problems/max-area-of-island/) | [力扣](https://leetcode-cn.com/problems/max-area-of-island/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0695-Max-Area-of-Island/0695.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104566219) | Medium | DFS |
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [LeetCode](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [力扣](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0714-Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee/0714.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104805622) | Medium | 动态规划 |
| 0744 | Find Smallest Letter Greater Than Target | [LeetCode](https://leetcode.com/problems/find-smallest-letter-greater-than-target/) | [力扣](https://leetcode-cn.com/problems/find-smallest-letter-greater-than-target/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0744-Find-Smallest-Letter-Greater-Than-Target/0744.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104446440) | Easy | 二分 |
| 0836 | Rectangle Overlap | [LeetCode](https://leetcode.com/problems/rectangle-overlap/) | [力扣](https://leetcode-cn.com/problems/rectangle-overlap/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0836-Rectangle-Overlap/0836.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104954609) | Easy | 数学 |
| 0876 | Middle of the Linked List | [LeetCode](https://leetcode.com/problems/middle-of-the-linked-list/) | [力扣](https://leetcode-cn.com/problems/middle-of-the-linked-list/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0876-Middle-of-the-Linked-List/0876.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105060017) | Easy | 双指针 |
| 0892 | Surface Area of 3D Shapes | [LeetCode](https://leetcode.com/problems/surface-area-of-3d-shapes/) | [力扣](https://leetcode-cn.com/problems/surface-area-of-3d-shapes/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0892-Surface-Area-of-3D-Shapes/0892.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105150406) | Easy | 数学 |
| 0914 | X of a Kind in a Deck of Cards | [LeetCode](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/) | [力扣](https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0914-X-of-a-Kind-in-a-Deck-of-Cards/0914.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105144538) | Easy | 数学 |
| 0994 | Rotting Oranges | [LeetCode](https://leetcode.com/problems/rotting-oranges/) | [力扣](https://leetcode-cn.com/problems/rotting-oranges/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/0994-Rotting-Oranges/0994.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104653642) | Easy | BFS |
| 1013 | Partition Array Into Three Parts With Equal Sum | [LeetCode](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/) | [力扣](https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1013-Partition-Array-Into-Three-Parts-With-Equal-Sum/1013.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104804635) | Easy | 双指针 |
| 1071 | Greatest Common Divisor of Strings | [LeetCode](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | [力扣](https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1071-Greatest-Common-Divisor-of-Strings/1071.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104829264) | Easy | 字符串 |
| 1091 | Shortest Path in Binary Matrix | [LeetCode](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | [力扣](https://leetcode-cn.com/problems/shortest-path-in-binary-matrix/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1091-Shortest-Path-in-Binary-Matrix/1091.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104525673) | Medium | BFS |
| 1103 | Distribute Candies to People | [LeetCode](https://leetcode.com/problems/distribute-candies-to-people/) | [力扣](https://leetcode-cn.com/problems/distribute-candies-to-people/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1103-Distribute-Candies-to-People/1103.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104675606) | Easy | 暴力 |
| 1160 | Find Words That Can Be Formed by Characters | [LeetCode](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | [力扣](https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1160-Find-Words-That-Can-Be-Formed-by-Characters/1160.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104923690) | Easy | 字符串 |
| 1358 | Number of Substrings Containing All Three Characters | [LeetCode](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | [力扣](https://leetcode-cn.com/problems/number-of-substrings-containing-all-three-characters/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1358-Number-of-Substrings-Containing-All-Three-Characters/1358.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104455690) | Medium | 双指针、滑窗 |
| 1360 | Number of Days Between Two Dates | [LeetCode](https://leetcode.com/problems/number-of-days-between-two-dates/) | [力扣](https://leetcode-cn.com/problems/number-of-days-between-two-dates/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1360-Number-of-Days-Between-Two-Dates/1360.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104462835) | Easy | 数学 |
| 1362 | Closest Divisors | [LeetCode](https://leetcode.com/problems/closest-divisors/) | [力扣](https://leetcode-cn.com/problems/closest-divisors/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/tree/master/solutions/1362-Closest-Divisors) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104464617) | Medium | 数学 |
| 1365 | How Many Numbers Are Smaller Than the Current Number | [LeetCode](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | [力扣](https://leetcode-cn.com/problems/how-many-numbers-are-smaller-than-the-current-number/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1365-How-Many-Numbers-Are-Smaller-Than-the-Current-Number/1365.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104593401) | Easy | 暴力 |
| 1366 | Rank Teams by Votes | [LeetCode](https://leetcode.com/problems/rank-teams-by-votes/) | [力扣](https://leetcode-cn.com/problems/rank-teams-by-votes/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1366-Rank-Teams-by-Votes/1366.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104602097) | Medium | 排序 |
| 1367 | Linked List in Binary Tree | [LeetCode](https://leetcode.com/problems/linked-list-in-binary-tree/) | [力扣](https://leetcode-cn.com/problems/linked-list-in-binary-tree/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1367-Linked-List-in-Binary-Tree/1367.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104592060) | Medium | DFS |
| 1370 | Increasing Decreasing String | [LeetCode](https://leetcode.com/problems/increasing-decreasing-string/) | [力扣](https://leetcode-cn.com/problems/increasing-decreasing-string/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1370-Increasing-Decreasing-String/1370.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104731560) | Easy | 排序 |
| 1372 | Longest ZigZag Path in a Binary Tree | [LeetCode](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/) | [力扣](https://leetcode-cn.com/problems/longest-zigzag-path-in-a-binary-tree/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1372-Longest-ZigZag-Path-in-a-Binary-Tree/1372.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104733479) | Medium | DFS |
| 1374 | Generate a String With Characters That Have Odd Counts | [LeetCode](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/) | [力扣](https://leetcode-cn.com/problems/generate-a-string-with-characters-that-have-odd-counts/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1374-Generate-a-String-With-Characters-That-Have-Odd-Counts/1374.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104733770) | Easy | 字符串 |
| 1375 | Bulb Switcher III | [LeetCode](https://leetcode.com/problems/bulb-switcher-iii/) | [力扣](https://leetcode-cn.com/problems/bulb-switcher-iii/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1375-Bulb-Switcher-III/1375.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104734212) | Medium | 最大编号 |
| 1376 | Time Needed to Inform All Employees | [LeetCode](https://leetcode.com/problems/time-needed-to-inform-all-employees/) | [力扣](https://leetcode-cn.com/problems/time-needed-to-inform-all-employees/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1376-Time-Needed-to-Inform-All-Employees/1376.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104742851) | Medium | 自底向上 |
| 1380 | Lucky Numbers in a Matrix | [LeetCode](https://leetcode.com/problems/lucky-numbers-in-a-matrix/) | [力扣](https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1380-Lucky-Numbers-in-a-Matrix/1380.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104877686) | Easy | 暴力 |
| 1381 | Design a Stack With Increment Operation | [LeetCode](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | [力扣](https://leetcode-cn.com/problems/design-a-stack-with-increment-operation/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1381-Design-a-Stack-With-Increment-Operation/1381.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104879183) | Medium | 栈 |
| 1382 | Balance a Binary Search Tree | [LeetCode](https://leetcode.com/problems/balance-a-binary-search-tree/) | [力扣](https://leetcode-cn.com/problems/balance-a-binary-search-tree/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1382-Balance-a-Binary-Search-Tree/1382.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104880901) | Medium | 二叉树 |
| 1385 | Find the Distance Value Between Two Arrays | [LeetCode](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/) | [力扣](https://leetcode-cn.com/problems/find-the-distance-value-between-two-arrays/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1385-Find-the-Distance-Value-Between-Two-Arrays/1385.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105022801) | Easy | 暴力 |
| 1386 | Cinema Seat Allocation | [LeetCode](https://leetcode.com/problems/cinema-seat-allocation/) | [力扣](https://leetcode-cn.com/problems/cinema-seat-allocation/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1386-Cinema-Seat-Allocation/1386.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105063788) | Medium | 哈希表 |
| 1387 | Sort Integers by The Power Value | [LeetCode](https://leetcode.com/problems/sort-integers-by-the-power-value/) | [力扣](https://leetcode-cn.com/problems/sort-integers-by-the-power-value/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1387-Sort-Integers-by-The-Power-Value/1387.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105023080) | Medium | 排序 |
| 1389 | Create Target Array in the Given Order | [LeetCode](https://leetcode.com/problems/create-target-array-in-the-given-order/) | [力扣](https://leetcode-cn.com/problems/create-target-array-in-the-given-order/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1389-Create-Target-Array-in-the-Given-Order/1389.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105063971) | Easy | 数组 |
| 1390 | Four Divisors | [LeetCode](https://leetcode.com/problems/four-divisors/) | [力扣](https://leetcode-cn.com/problems/four-divisors/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1390-Four-Divisors/1390.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105064381) | Medium | 数学 |
| 1394 | Find Lucky Integer in an Array | [LeetCode](https://leetcode.com/problems/find-lucky-integer-in-an-array/) | [力扣](https://leetcode-cn.com/problems/find-lucky-integer-in-an-array/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1394-Find-Lucky-Integer-in-an-Array/1394.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105178838) | Easy | 暴力 |
| 1395 | Count Number of Teams | [LeetCode](https://leetcode.com/problems/count-number-of-teams/) | [力扣](https://leetcode-cn.com/problems/count-number-of-teams/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1395-Count-Number-of-Teams/1395.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105178534) | Medium | 暴力 |
| 1396 | Design Underground System | [LeetCode](https://leetcode.com/problems/design-underground-system/) | [力扣](https://leetcode-cn.com/problems/design-underground-system/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/1396-Design-Underground-System/1396.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105177955) | Medium | 设计 |
| 面试题03 | 数组中重复的数字 |  | [力扣](https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-03-shu-zu-zhong-zhong-fu-de-shu-zi-lcof/03.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104929428) | Easy | 哈希 |
| 面试题04 | 二维数组中的查找 |  | [力扣](https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-04-er-wei-shu-zu-zhong-de-cha-zhao-lcof/04.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104930463) | Easy | 数组 |
| 面试题05 | 替换空格 |  | [力扣](https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-05-ti-huan-kong-ge-lcof/05.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104933419) | Easy | 字符串 |
| 面试题06 | 从尾到头打印链表 |  | [力扣](https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-06-cong-wei-dao-tou-da-yin-lian-biao-lcof/06.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104934559) | Easy | 链表 |
| 面试题07 | 重建二叉树 |  | [力扣](https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-07-zhong-jian-er-cha-shu-lcof/07.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104952401) | Medium | 二叉树、递归 |
| 面试题09 | 用两个栈实现队列 | | [力扣](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-09-yong-liang-ge-zhan-shi-xian-dui-lie-lcof/09.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105149787) | Easy | 栈、队列 |
| 面试题10- I | 斐波那契数列 | | [力扣](https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10-fei-bo-na-qi-shu-lie-lcof/10-1.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105147333) | Easy | 动态规划 |
| 面试题10- II | 青蛙跳台阶问题 | | [力扣](https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10-qing-wa-tiao-tai-jie-wen-ti-lcof/10-2.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105147944) | Easy | 动态规划 |
| 面试题17 | 打印从1到最大的n位数 | | [力扣](https://leetcode-cn.com/problems/da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-17-da-yin-cong-1dao-zui-da-de-nwei-shu-lcof/17.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105149990) | Easy | 暴力 |
| 面试题26 | 树的子结构 |  | [力扣](https://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-26-shu-de-zi-jie-gou-lcof/26.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104957270) | Medium | DFS |
| 面试题27 | 二叉树的镜像 |  | [力扣](https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-27-er-cha-shu-de-jing-xiang-lcof/27.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104977404) | Easy | 二叉树、递归 |
| 面试题32 - I | 从上到下打印二叉树 | | [力扣](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-lcof/32.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104979819) | Medium | 二叉树、BFS |
| 面试题32 - II | 从上到下打印二叉树 II | | [力扣](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof/32-2.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105000947) | Easy | 二叉树、BFS |
| 面试题32 - III | 从上到下打印二叉树 III | | [力扣](https://leetcode-cn.com/problems/cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-32-cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof/32-3.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105001825) | Medium | 二叉树、BFS |
| 面试题33 | 二叉搜索树的后序遍历序列 | | [力扣](https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-33-er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/33.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105015692) | Medium | 递归 |
| 面试题34       | 二叉树中和为某一值的路径                                   |                                                              | [力扣](https://leetcode-cn.com/problems/er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-34-er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof/34.py) |      | [CSDN](https://wonzwang.blog.csdn.net/article/details/105060958) | Medium     | 回溯           |
| 面试题38 |                                                            |                                                              |                                                              |                                                              |      |                                                              |            |                |
|                |                                                            |                                                              |                                                              |                                                              |      |                                                              |            |                |
| 面试题 57 - II | 和为s的连续正数序列 | | [力扣](https://leetcode-cn.com/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-57-II/5702.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104696171) | Easy | 滑窗、数学 |
| 面试题59 - II | 队列的最大值 | | [力扣](https://leetcode-cn.com/problems/dui-lie-de-zui-da-zhi-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-59-II/5902.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104731137) | Medium | 队列 |
| 面试题62 | 圆圈中最后剩下的数字 | | [力扣](https://leetcode-cn.com/problems/yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-62-yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof/62.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/105080925) | Easy | 数学 |
| 面试题0106 | 字符串压缩 | | [力扣](https://leetcode-cn.com/problems/compress-string-lcci/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-01.06-compress-string-lcci/0106.py) | | [CSDN](https://blog.csdn.net/Wonz5130/article/details/104910414) | Easy | 双指针 |
| 面试0410 | 检查子树 | | [力扣](https://leetcode-cn.com/problems/check-subtree-lcci/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-04.10-check-subtree-lcci/0410.py) | | [CSDN](https://wonzwang.blog.csdn.net/article/details/104592940) | Medium | DFS |
| 面试1001 | Sorted Merge LCCI | | [力扣](https://leetcode-cn.com/problems/sorted-merge-lcci/) | [Python](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/solutions/Interview-10.01-Sorted-Merge-LCCI/1001.py) | | [CSDN](https://blog.csdn.net/Wonz5130/article/details/104630799) | Easy | 双指针 |

### 推荐题解

[CyC LeetCode 题解](https://github.com/CyC2018/CS-Notes/blob/master/notes/Leetcode%20%E9%A2%98%E8%A7%A3%20-%20%E7%9B%AE%E5%BD%95.md)

[负雪明烛 LeetCode 题解](https://blog.csdn.net/fuxuemingzhu/category_5790037.html)

[coordinate LeetCode 题解](https://coordinate.wang/)

[书影 LeetCode 题解](http://bookshadow.com/leetcode/)

[ApacheCN LeetCode 题解](https://github.com/apachecn/Interview/tree/master/docs/Algorithm/Leetcode/Python)

[PemLer LeetCode 题解](https://github.com/PemLer/Journey_of_leetcode/tree/master/leetcode)

### License

[MIT](https://github.com/Wonz5130/LeetCode-Solutions/blob/master/LICENSE)