Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kamtohung/leetcode
learn leetcode
https://github.com/kamtohung/leetcode
leetcode
Last synced: about 2 months ago
JSON representation
learn leetcode
- Host: GitHub
- URL: https://github.com/kamtohung/leetcode
- Owner: KamToHung
- Created: 2022-07-12T03:11:01.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-01-25T13:53:00.000Z (11 months ago)
- Last Synced: 2024-10-12T07:37:31.729Z (3 months ago)
- Topics: leetcode
- Language: Java
- Homepage:
- Size: 5.33 MB
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
| [English](README_EN.md) | 简体中文 |
[My leetcode](https://leetcode.cn/u/kamto-hung/)
My LeetCode Solutions
| # | 题目 | 难度 | 标签 |
| :----: | :---- | :----: | :----: |
|[1](https://leetcode-cn.com/problems/two-sum)|[两数之和](https://github.com/KamToHung/leetcode/tree/main/算法/1.%20两数之和)|简单|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) |
|[2](https://leetcode-cn.com/problems/add-two-numbers)|[两数相加](https://github.com/KamToHung/leetcode/tree/main/算法/2.%20两数相加)|中等|[递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) [数学](https://leetcode-cn.com/tag/math) |
|[3](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)|[无重复字符的最长子串](https://github.com/KamToHung/leetcode/tree/main/算法/3.%20无重复字符的最长子串)|中等|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [滑动窗口](https://leetcode-cn.com/tag/sliding-window) |
|[5](https://leetcode-cn.com/problems/longest-palindromic-substring)|[最长回文子串](https://github.com/KamToHung/leetcode/tree/main/算法/5.%20最长回文子串)|中等|[字符串](https://leetcode-cn.com/tag/string) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[7](https://leetcode-cn.com/problems/reverse-integer)|[整数反转](https://github.com/KamToHung/leetcode/tree/main/算法/7.%20整数反转)|中等|[数学](https://leetcode-cn.com/tag/math) |
|[9](https://leetcode-cn.com/problems/palindrome-number)|[回文数](https://github.com/KamToHung/leetcode/tree/main/算法/9.%20回文数)|简单|[数学](https://leetcode-cn.com/tag/math) |
|[11](https://leetcode-cn.com/problems/container-with-most-water)|[盛最多水的容器](https://github.com/KamToHung/leetcode/tree/main/算法/11.%20盛最多水的容器)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[12](https://leetcode-cn.com/problems/integer-to-roman)|[整数转罗马数字](https://github.com/KamToHung/leetcode/tree/main/算法/12.%20整数转罗马数字)|中等|[哈希表](https://leetcode-cn.com/tag/hash-table) [数学](https://leetcode-cn.com/tag/math) [字符串](https://leetcode-cn.com/tag/string) |
|[13](https://leetcode-cn.com/problems/roman-to-integer)|[罗马数字转整数](https://github.com/KamToHung/leetcode/tree/main/算法/13.%20罗马数字转整数)|简单|[哈希表](https://leetcode-cn.com/tag/hash-table) [数学](https://leetcode-cn.com/tag/math) [字符串](https://leetcode-cn.com/tag/string) |
|[14](https://leetcode-cn.com/problems/longest-common-prefix)|[最长公共前缀](https://github.com/KamToHung/leetcode/tree/main/算法/14.%20最长公共前缀)|简单|[字符串](https://leetcode-cn.com/tag/string) |
|[15](https://leetcode-cn.com/problems/3sum)|[三数之和](https://github.com/KamToHung/leetcode/tree/main/算法/15.%20三数之和)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [排序](https://leetcode-cn.com/tag/sorting) |
|[16](https://leetcode-cn.com/problems/3sum-closest)|[最接近的三数之和](https://github.com/KamToHung/leetcode/tree/main/算法/16.%20最接近的三数之和)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [排序](https://leetcode-cn.com/tag/sorting) |
|[17](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number)|[电话号码的字母组合](https://github.com/KamToHung/leetcode/tree/main/算法/17.%20电话号码的字母组合)|中等|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[18](https://leetcode-cn.com/problems/4sum)|[四数之和](https://github.com/KamToHung/leetcode/tree/main/算法/18.%20四数之和)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [排序](https://leetcode-cn.com/tag/sorting) |
|[19](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list)|[删除链表的倒数第 N 个结点](https://github.com/KamToHung/leetcode/tree/main/算法/19.%20删除链表的倒数第%20N%20个结点)|中等|[链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[20](https://leetcode-cn.com/problems/valid-parentheses)|[有效的括号](https://github.com/KamToHung/leetcode/tree/main/算法/20.%20有效的括号)|简单|[栈](https://leetcode-cn.com/tag/stack) [字符串](https://leetcode-cn.com/tag/string) |
|[21](https://leetcode-cn.com/problems/merge-two-sorted-lists)|[合并两个有序链表](https://github.com/KamToHung/leetcode/tree/main/算法/21.%20合并两个有序链表)|简单|[递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) |
|[22](https://leetcode-cn.com/problems/generate-parentheses)|[括号生成](https://github.com/KamToHung/leetcode/tree/main/算法/22.%20括号生成)|中等|[字符串](https://leetcode-cn.com/tag/string) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[23](https://leetcode-cn.com/problems/merge-k-sorted-lists)|[合并K个升序链表](https://github.com/KamToHung/leetcode/tree/main/算法/23.%20合并K个升序链表)|困难|[链表](https://leetcode-cn.com/tag/linked-list) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [堆（优先队列）](https://leetcode-cn.com/tag/heap-priority-queue) [归并排序](https://leetcode-cn.com/tag/merge-sort) |
|[25](https://leetcode-cn.com/problems/reverse-nodes-in-k-group)|[K 个一组翻转链表](https://github.com/KamToHung/leetcode/tree/main/算法/25.%20K%20个一组翻转链表)|困难|[递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) |
|[26](https://leetcode-cn.com/problems/remove-duplicates-from-sorted-array)|[删除有序数组中的重复项](https://github.com/KamToHung/leetcode/tree/main/算法/26.%20删除有序数组中的重复项)|简单|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[27](https://leetcode-cn.com/problems/remove-element)|[移除元素](https://github.com/KamToHung/leetcode/tree/main/算法/27.%20移除元素)|简单|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[28](https://leetcode-cn.com/problems/implement-strstr)|[实现 strStr()](https://github.com/KamToHung/leetcode/tree/main/算法/28.%20实现%20strStr())|简单|[双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) [字符串匹配](https://leetcode-cn.com/tag/string-matching) |
|[32](https://leetcode-cn.com/problems/longest-valid-parentheses)|[最长有效括号](https://github.com/KamToHung/leetcode/tree/main/算法/32.%20最长有效括号)|困难|[栈](https://leetcode-cn.com/tag/stack) [字符串](https://leetcode-cn.com/tag/string) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[34](https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array)|[在排序数组中查找元素的第一个和最后一个位置](https://github.com/KamToHung/leetcode/tree/main/算法/34.%20在排序数组中查找元素的第一个和最后一个位置)|中等|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[35](https://leetcode-cn.com/problems/search-insert-position)|[搜索插入位置](https://github.com/KamToHung/leetcode/tree/main/算法/35.%20搜索插入位置)|简单|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[36](https://leetcode-cn.com/problems/valid-sudoku)|[有效的数独](https://github.com/KamToHung/leetcode/tree/main/算法/36.%20有效的数独)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[39](https://leetcode-cn.com/problems/combination-sum)|[组合总和](https://github.com/KamToHung/leetcode/tree/main/算法/39.%20组合总和)|中等|[数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[40](https://leetcode-cn.com/problems/combination-sum-ii)|[组合总和 II](https://github.com/KamToHung/leetcode/tree/main/算法/40.%20组合总和%20II)|中等|[数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[46](https://leetcode-cn.com/problems/permutations)|[全排列](https://github.com/KamToHung/leetcode/tree/main/算法/46.%20全排列)|中等|[数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[47](https://leetcode-cn.com/problems/permutations-ii)|[全排列 II](https://github.com/KamToHung/leetcode/tree/main/算法/47.%20全排列%20II)|中等|[数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[48](https://leetcode-cn.com/problems/rotate-image)|[旋转图像](https://github.com/KamToHung/leetcode/tree/main/算法/48.%20旋转图像)|中等|[数组](https://leetcode-cn.com/tag/array) [数学](https://leetcode-cn.com/tag/math) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[53](https://leetcode-cn.com/problems/maximum-subarray)|[最大子数组和](https://github.com/KamToHung/leetcode/tree/main/算法/53.%20最大子数组和)|简单|[数组](https://leetcode-cn.com/tag/array) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[54](https://leetcode-cn.com/problems/spiral-matrix)|[螺旋矩阵](https://github.com/KamToHung/leetcode/tree/main/算法/54.%20螺旋矩阵)|中等|[数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) [模拟](https://leetcode-cn.com/tag/simulation) |
|[55](https://leetcode-cn.com/problems/jump-game)|[跳跃游戏](https://github.com/KamToHung/leetcode/tree/main/算法/55.%20跳跃游戏)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[56](https://leetcode-cn.com/problems/merge-intervals)|[合并区间](https://github.com/KamToHung/leetcode/tree/main/算法/56.%20合并区间)|中等|[数组](https://leetcode-cn.com/tag/array) [排序](https://leetcode-cn.com/tag/sorting) |
|[57](https://leetcode-cn.com/problems/insert-interval)|[插入区间](https://github.com/KamToHung/leetcode/tree/main/算法/57.%20插入区间)|中等|[数组](https://leetcode-cn.com/tag/array) |
|[61](https://leetcode-cn.com/problems/rotate-list)|[旋转链表](https://github.com/KamToHung/leetcode/tree/main/算法/61.%20旋转链表)|中等|[链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[62](https://leetcode-cn.com/problems/unique-paths)|[不同路径](https://github.com/KamToHung/leetcode/tree/main/算法/62.%20不同路径)|中等|[数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [组合数学](https://leetcode-cn.com/tag/combinatorics) |
|[63](https://leetcode-cn.com/problems/unique-paths-ii)|[不同路径 II](https://github.com/KamToHung/leetcode/tree/main/算法/63.%20不同路径%20II)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[64](https://leetcode-cn.com/problems/minimum-path-sum)|[最小路径和](https://github.com/KamToHung/leetcode/tree/main/算法/64.%20最小路径和)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[70](https://leetcode-cn.com/problems/climbing-stairs)|[爬楼梯](https://github.com/KamToHung/leetcode/tree/main/算法/70.%20爬楼梯)|简单|[记忆化搜索](https://leetcode-cn.com/tag/memoization) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[75](https://leetcode-cn.com/problems/sort-colors)|[颜色分类](https://github.com/KamToHung/leetcode/tree/main/算法/75.%20颜色分类)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [排序](https://leetcode-cn.com/tag/sorting) |
|[77](https://leetcode-cn.com/problems/combinations)|[组合](https://github.com/KamToHung/leetcode/tree/main/算法/77.%20组合)|中等|[回溯](https://leetcode-cn.com/tag/backtracking) |
|[78](https://leetcode-cn.com/problems/subsets)|[子集](https://github.com/KamToHung/leetcode/tree/main/算法/78.%20子集)|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[86](https://leetcode-cn.com/problems/partition-list)|[分隔链表](https://github.com/KamToHung/leetcode/tree/main/算法/86.%20分隔链表)|中等|[链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[90](https://leetcode-cn.com/problems/subsets-ii)|[子集 II](https://github.com/KamToHung/leetcode/tree/main/算法/90.%20子集%20II)|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[92](https://leetcode-cn.com/problems/reverse-linked-list-ii)|[反转链表 II](https://github.com/KamToHung/leetcode/tree/main/算法/92.%20反转链表%20II)|中等|[链表](https://leetcode-cn.com/tag/linked-list) |
|[94](https://leetcode-cn.com/problems/binary-tree-inorder-traversal)|[二叉树的中序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/94.%20二叉树的中序遍历)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[95](https://leetcode-cn.com/problems/unique-binary-search-trees-ii)|[不同的二叉搜索树 II](https://github.com/KamToHung/leetcode/tree/main/算法/95.%20不同的二叉搜索树%20II)|中等|[树](https://leetcode-cn.com/tag/tree) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [回溯](https://leetcode-cn.com/tag/backtracking) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[96](https://leetcode-cn.com/problems/unique-binary-search-trees)|[不同的二叉搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/96.%20不同的二叉搜索树)|中等|[树](https://leetcode-cn.com/tag/tree) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[98](https://leetcode-cn.com/problems/validate-binary-search-tree)|[验证二叉搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/98.%20验证二叉搜索树)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[99](https://leetcode-cn.com/problems/recover-binary-search-tree)|[恢复二叉搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/99.%20恢复二叉搜索树)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[100](https://leetcode-cn.com/problems/same-tree)|[相同的树](https://github.com/KamToHung/leetcode/tree/main/算法/100.%20相同的树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[101](https://leetcode-cn.com/problems/symmetric-tree)|[对称二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/101.%20对称二叉树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[102](https://leetcode-cn.com/problems/binary-tree-level-order-traversal)|[二叉树的层序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/102.%20二叉树的层序遍历)|中等|[树](https://leetcode-cn.com/tag/tree) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[103](https://leetcode-cn.com/problems/binary-tree-zigzag-level-order-traversal)|[二叉树的锯齿形层序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/103.%20二叉树的锯齿形层序遍历)|中等|[树](https://leetcode-cn.com/tag/tree) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[104](https://leetcode-cn.com/problems/maximum-depth-of-binary-tree)|[二叉树的最大深度](https://github.com/KamToHung/leetcode/tree/main/算法/104.%20二叉树的最大深度)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[105](https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal)|[从前序与中序遍历序列构造二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/105.%20从前序与中序遍历序列构造二叉树)|中等|[树](https://leetcode-cn.com/tag/tree) [数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[106](https://leetcode-cn.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal)|[从中序与后序遍历序列构造二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/106.%20从中序与后序遍历序列构造二叉树)|中等|[树](https://leetcode-cn.com/tag/tree) [数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[107](https://leetcode-cn.com/problems/binary-tree-level-order-traversal-ii)|[二叉树的层序遍历 II](https://github.com/KamToHung/leetcode/tree/main/算法/107.%20二叉树的层序遍历%20II)|中等|[树](https://leetcode-cn.com/tag/tree) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[108](https://leetcode-cn.com/problems/convert-sorted-array-to-binary-search-tree)|[将有序数组转换为二叉搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/108.%20将有序数组转换为二叉搜索树)|简单|[树](https://leetcode-cn.com/tag/tree) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [数组](https://leetcode-cn.com/tag/array) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[109](https://leetcode-cn.com/problems/convert-sorted-list-to-binary-search-tree)|[有序链表转换二叉搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/109.%20有序链表转换二叉搜索树)|中等|[树](https://leetcode-cn.com/tag/tree) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [链表](https://leetcode-cn.com/tag/linked-list) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[110](https://leetcode-cn.com/problems/balanced-binary-tree)|[平衡二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/110.%20平衡二叉树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[111](https://leetcode-cn.com/problems/minimum-depth-of-binary-tree)|[二叉树的最小深度](https://github.com/KamToHung/leetcode/tree/main/算法/111.%20二叉树的最小深度)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[112](https://leetcode-cn.com/problems/path-sum)|[路径总和](https://github.com/KamToHung/leetcode/tree/main/算法/112.%20路径总和)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[113](https://leetcode-cn.com/problems/path-sum-ii)|[路径总和 II](https://github.com/KamToHung/leetcode/tree/main/算法/113.%20路径总和%20II)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [回溯](https://leetcode-cn.com/tag/backtracking) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[114](https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list)|[二叉树展开为链表](https://github.com/KamToHung/leetcode/tree/main/算法/114.%20二叉树展开为链表)|中等|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [链表](https://leetcode-cn.com/tag/linked-list) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[116](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node)|[填充每个节点的下一个右侧节点指针](https://github.com/KamToHung/leetcode/tree/main/算法/116.%20填充每个节点的下一个右侧节点指针)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [链表](https://leetcode-cn.com/tag/linked-list) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[117](https://leetcode-cn.com/problems/populating-next-right-pointers-in-each-node-ii)|[填充每个节点的下一个右侧节点指针 II](https://github.com/KamToHung/leetcode/tree/main/算法/117.%20填充每个节点的下一个右侧节点指针%20II)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [链表](https://leetcode-cn.com/tag/linked-list) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[118](https://leetcode-cn.com/problems/pascals-triangle)|[杨辉三角](https://github.com/KamToHung/leetcode/tree/main/算法/118.%20杨辉三角)|简单|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[119](https://leetcode-cn.com/problems/pascals-triangle-ii)|[杨辉三角 II](https://github.com/KamToHung/leetcode/tree/main/算法/119.%20杨辉三角%20II)|简单|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[121](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock)|[买卖股票的最佳时机](https://github.com/KamToHung/leetcode/tree/main/算法/121.%20买卖股票的最佳时机)|简单|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[122](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii)|[买卖股票的最佳时机 II](https://github.com/KamToHung/leetcode/tree/main/算法/122.%20买卖股票的最佳时机%20II)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[124](https://leetcode-cn.com/problems/binary-tree-maximum-path-sum)|[二叉树中的最大路径和](https://github.com/KamToHung/leetcode/tree/main/算法/124.%20二叉树中的最大路径和)|困难|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[129](https://leetcode-cn.com/problems/sum-root-to-leaf-numbers)|[求根节点到叶节点数字之和](https://github.com/KamToHung/leetcode/tree/main/算法/129.%20求根节点到叶节点数字之和)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[136](https://leetcode-cn.com/problems/single-number)|[只出现一次的数字](https://github.com/KamToHung/leetcode/tree/main/算法/136.%20只出现一次的数字)|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) |
|[137](https://leetcode-cn.com/problems/single-number-ii)|[只出现一次的数字 II](https://github.com/KamToHung/leetcode/tree/main/算法/137.%20只出现一次的数字%20II)|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) |
|[144](https://leetcode-cn.com/problems/binary-tree-preorder-traversal)|[二叉树的前序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/144.%20二叉树的前序遍历)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[145](https://leetcode-cn.com/problems/binary-tree-postorder-traversal)|[二叉树的后序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/145.%20二叉树的后序遍历)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[146](https://leetcode-cn.com/problems/lru-cache)|[LRU 缓存](https://github.com/KamToHung/leetcode/tree/main/算法/146.%20LRU%20缓存)|中等|[设计](https://leetcode-cn.com/tag/design) [哈希表](https://leetcode-cn.com/tag/hash-table) [链表](https://leetcode-cn.com/tag/linked-list) [双向链表](https://leetcode-cn.com/tag/doubly-linked-list) |
|[148](https://leetcode-cn.com/problems/sort-list)|[排序链表](https://github.com/KamToHung/leetcode/tree/main/算法/148.%20排序链表)|中等|[链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [排序](https://leetcode-cn.com/tag/sorting) [归并排序](https://leetcode-cn.com/tag/merge-sort) |
|[151](https://leetcode-cn.com/problems/reverse-words-in-a-string)|[颠倒字符串中的单词](https://github.com/KamToHung/leetcode/tree/main/算法/151.%20颠倒字符串中的单词)|中等|[双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) |
|[167](https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted)|[两数之和 II - 输入有序数组](https://github.com/KamToHung/leetcode/tree/main/算法/167.%20两数之和%20II%20-%20输入有序数组)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[191](https://leetcode-cn.com/problems/number-of-1-bits)|[位1的个数](https://github.com/KamToHung/leetcode/tree/main/算法/191.%20位1的个数)|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [分治](https://leetcode-cn.com/tag/divide-and-conquer) |
|[198](https://leetcode-cn.com/problems/house-robber)|[打家劫舍](https://github.com/KamToHung/leetcode/tree/main/算法/198.%20打家劫舍)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[199](https://leetcode-cn.com/problems/binary-tree-right-side-view)|[二叉树的右视图](https://github.com/KamToHung/leetcode/tree/main/算法/199.%20二叉树的右视图)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[200](https://leetcode-cn.com/problems/number-of-islands)|[岛屿数量](https://github.com/KamToHung/leetcode/tree/main/算法/200.%20岛屿数量)|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [并查集](https://leetcode-cn.com/tag/union-find) [数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[203](https://leetcode-cn.com/problems/remove-linked-list-elements)|[移除链表元素](https://github.com/KamToHung/leetcode/tree/main/算法/203.%20移除链表元素)|简单|[递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) |
|[206](https://leetcode-cn.com/problems/reverse-linked-list)|[反转链表](https://github.com/KamToHung/leetcode/tree/main/算法/206.%20反转链表)|简单|[递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) |
|[213](https://leetcode-cn.com/problems/house-robber-ii)|[打家劫舍 II](https://github.com/KamToHung/leetcode/tree/main/算法/213.%20打家劫舍%20II)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[215](https://leetcode-cn.com/problems/kth-largest-element-in-an-array)|[数组中的第K个最大元素](https://github.com/KamToHung/leetcode/tree/main/算法/215.%20数组中的第K个最大元素)|中等|[数组](https://leetcode-cn.com/tag/array) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [快速选择](https://leetcode-cn.com/tag/quickselect) [排序](https://leetcode-cn.com/tag/sorting) [堆（优先队列）](https://leetcode-cn.com/tag/heap-priority-queue) |
|[222](https://leetcode-cn.com/problems/count-complete-tree-nodes)|[完全二叉树的节点个数](https://github.com/KamToHung/leetcode/tree/main/算法/222.%20完全二叉树的节点个数)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二分查找](https://leetcode-cn.com/tag/binary-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[226](https://leetcode-cn.com/problems/invert-binary-tree)|[翻转二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/226.%20翻转二叉树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[230](https://leetcode-cn.com/problems/kth-smallest-element-in-a-bst)|[二叉搜索树中第K小的元素](https://github.com/KamToHung/leetcode/tree/main/算法/230.%20二叉搜索树中第K小的元素)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[231](https://leetcode-cn.com/problems/power-of-two)|[2 的幂](https://github.com/KamToHung/leetcode/tree/main/算法/231.%202%20的幂)|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [递归](https://leetcode-cn.com/tag/recursion) [数学](https://leetcode-cn.com/tag/math) |
|[234](https://leetcode-cn.com/problems/palindrome-linked-list)|[回文链表](https://github.com/KamToHung/leetcode/tree/main/算法/234.%20回文链表)|简单|[栈](https://leetcode-cn.com/tag/stack) [递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[235](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|[二叉搜索树的最近公共祖先](https://github.com/KamToHung/leetcode/tree/main/算法/235.%20二叉搜索树的最近公共祖先)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[236](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-tree)|[二叉树的最近公共祖先](https://github.com/KamToHung/leetcode/tree/main/算法/236.%20二叉树的最近公共祖先)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[257](https://leetcode-cn.com/problems/binary-tree-paths)|[二叉树的所有路径](https://github.com/KamToHung/leetcode/tree/main/算法/257.%20二叉树的所有路径)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [字符串](https://leetcode-cn.com/tag/string) [回溯](https://leetcode-cn.com/tag/backtracking) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[260](https://leetcode-cn.com/problems/single-number-iii)|[只出现一次的数字 III](https://github.com/KamToHung/leetcode/tree/main/算法/260.%20只出现一次的数字%20III)|中等|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) |
|[268](https://leetcode-cn.com/problems/missing-number)|[丢失的数字](https://github.com/KamToHung/leetcode/tree/main/算法/268.%20丢失的数字)|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [数学](https://leetcode-cn.com/tag/math) [二分查找](https://leetcode-cn.com/tag/binary-search) [排序](https://leetcode-cn.com/tag/sorting) |
|[300](https://leetcode-cn.com/problems/longest-increasing-subsequence)|[最长递增子序列](https://github.com/KamToHung/leetcode/tree/main/算法/300.%20最长递增子序列)|中等|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[303](https://leetcode-cn.com/problems/range-sum-query-immutable)|[区域和检索 - 数组不可变](https://github.com/KamToHung/leetcode/tree/main/算法/303.%20区域和检索%20-%20数组不可变)|简单|[设计](https://leetcode-cn.com/tag/design) [数组](https://leetcode-cn.com/tag/array) [前缀和](https://leetcode-cn.com/tag/prefix-sum) |
|[322](https://leetcode-cn.com/problems/coin-change)|[零钱兑换](https://github.com/KamToHung/leetcode/tree/main/算法/322.%20零钱兑换)|中等|[广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[328](https://leetcode-cn.com/problems/odd-even-linked-list)|[奇偶链表](https://github.com/KamToHung/leetcode/tree/main/算法/328.%20奇偶链表)|中等|[链表](https://leetcode-cn.com/tag/linked-list) |
|[344](https://leetcode-cn.com/problems/reverse-string)|[反转字符串](https://github.com/KamToHung/leetcode/tree/main/算法/344.%20反转字符串)|简单|[递归](https://leetcode-cn.com/tag/recursion) [双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) |
|[347](https://leetcode-cn.com/problems/top-k-frequent-elements)|[前 K 个高频元素](https://github.com/KamToHung/leetcode/tree/main/算法/347.%20前%20K%20个高频元素)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [桶排序](https://leetcode-cn.com/tag/bucket-sort) [计数](https://leetcode-cn.com/tag/counting) [快速选择](https://leetcode-cn.com/tag/quickselect) [排序](https://leetcode-cn.com/tag/sorting) [堆（优先队列）](https://leetcode-cn.com/tag/heap-priority-queue) |
|[392](https://leetcode-cn.com/problems/is-subsequence)|[判断子序列](https://github.com/KamToHung/leetcode/tree/main/算法/392.%20判断子序列)|简单|[双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[404](https://leetcode-cn.com/problems/sum-of-left-leaves)|[左叶子之和](https://github.com/KamToHung/leetcode/tree/main/算法/404.%20左叶子之和)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[429](https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal)|[N 叉树的层序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/429.%20N%20叉树的层序遍历)|中等|[树](https://leetcode-cn.com/tag/tree) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) |
|[448](https://leetcode-cn.com/problems/find-all-numbers-disappeared-in-an-array)|[找到所有数组中消失的数字](https://github.com/KamToHung/leetcode/tree/main/算法/448.%20找到所有数组中消失的数字)|简单|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) |
|[455](https://leetcode-cn.com/problems/assign-cookies)|[分发饼干](https://github.com/KamToHung/leetcode/tree/main/算法/455.%20分发饼干)|简单|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) [排序](https://leetcode-cn.com/tag/sorting) |
|[485](https://leetcode-cn.com/problems/max-consecutive-ones)|[最大连续 1 的个数](https://github.com/KamToHung/leetcode/tree/main/算法/485.%20最大连续%201%20的个数)|简单|[数组](https://leetcode-cn.com/tag/array) |
|[494](https://leetcode-cn.com/problems/target-sum)|[目标和](https://github.com/KamToHung/leetcode/tree/main/算法/494.%20目标和)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [回溯](https://leetcode-cn.com/tag/backtracking) |
|[496](https://leetcode-cn.com/problems/next-greater-element-i)|[下一个更大元素 I](https://github.com/KamToHung/leetcode/tree/main/算法/496.%20下一个更大元素%20I)|简单|[栈](https://leetcode-cn.com/tag/stack) [数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [单调栈](https://leetcode-cn.com/tag/monotonic-stack) |
|[500](https://leetcode-cn.com/problems/keyboard-row)|[键盘行](https://github.com/KamToHung/leetcode/tree/main/算法/500.%20键盘行)|简单|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) |
|[509](https://leetcode-cn.com/problems/fibonacci-number)|[斐波那契数](https://github.com/KamToHung/leetcode/tree/main/算法/509.%20斐波那契数)|简单|[递归](https://leetcode-cn.com/tag/recursion) [记忆化搜索](https://leetcode-cn.com/tag/memoization) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[518](https://leetcode-cn.com/problems/coin-change-2)|[零钱兑换 II](https://github.com/KamToHung/leetcode/tree/main/算法/518.%20零钱兑换%20II)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[530](https://leetcode-cn.com/problems/minimum-absolute-difference-in-bst)|[二叉搜索树的最小绝对差](https://github.com/KamToHung/leetcode/tree/main/算法/530.%20二叉搜索树的最小绝对差)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[538](https://leetcode-cn.com/problems/convert-bst-to-greater-tree)|[把二叉搜索树转换为累加树](https://github.com/KamToHung/leetcode/tree/main/算法/538.%20把二叉搜索树转换为累加树)|中等|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[543](https://leetcode-cn.com/problems/diameter-of-binary-tree)|[二叉树的直径](https://github.com/KamToHung/leetcode/tree/main/算法/543.%20二叉树的直径)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[559](https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree)|[N 叉树的最大深度](https://github.com/KamToHung/leetcode/tree/main/算法/559.%20N%20叉树的最大深度)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) |
|[560](https://leetcode-cn.com/problems/subarray-sum-equals-k)|[和为 K 的子数组](https://github.com/KamToHung/leetcode/tree/main/算法/560.%20和为%20K%20的子数组)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [前缀和](https://leetcode-cn.com/tag/prefix-sum) |
|[572](https://leetcode-cn.com/problems/subtree-of-another-tree)|[另一棵树的子树](https://github.com/KamToHung/leetcode/tree/main/算法/572.%20另一棵树的子树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) [字符串匹配](https://leetcode-cn.com/tag/string-matching) [哈希函数](https://leetcode-cn.com/tag/hash-function) |
|[589](https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal)|[N 叉树的前序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/589.%20N%20叉树的前序遍历)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) |
|[590](https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal)|[N 叉树的后序遍历](https://github.com/KamToHung/leetcode/tree/main/算法/590.%20N%20叉树的后序遍历)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) |
|[617](https://leetcode-cn.com/problems/merge-two-binary-trees)|[合并二叉树](https://github.com/KamToHung/leetcode/tree/main/算法/617.%20合并二叉树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[647](https://leetcode-cn.com/problems/palindromic-substrings)|[回文子串](https://github.com/KamToHung/leetcode/tree/main/算法/647.%20回文子串)|中等|[字符串](https://leetcode-cn.com/tag/string) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[671](https://leetcode-cn.com/problems/second-minimum-node-in-a-binary-tree)|[二叉树中第二小的节点](https://github.com/KamToHung/leetcode/tree/main/算法/671.%20二叉树中第二小的节点)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[673](https://leetcode-cn.com/problems/number-of-longest-increasing-subsequence)|[最长递增子序列的个数](https://github.com/KamToHung/leetcode/tree/main/算法/673.%20最长递增子序列的个数)|中等|[树状数组](https://leetcode-cn.com/tag/binary-indexed-tree) [线段树](https://leetcode-cn.com/tag/segment-tree) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[704](https://leetcode-cn.com/problems/binary-search)|[二分查找](https://github.com/KamToHung/leetcode/tree/main/算法/704.%20二分查找)|简单|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[746](https://leetcode-cn.com/problems/min-cost-climbing-stairs)|[使用最小花费爬楼梯](https://github.com/KamToHung/leetcode/tree/main/算法/746.%20使用最小花费爬楼梯)|简单|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[808](https://leetcode-cn.com/problems/soup-servings)|[分汤](https://github.com/KamToHung/leetcode/tree/main/算法/808.%20分汤)|中等|[数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [概率与统计](https://leetcode-cn.com/tag/probability-and-statistics) |
|[811](https://leetcode-cn.com/problems/subdomain-visit-count)|[子域名访问计数](https://github.com/KamToHung/leetcode/tree/main/算法/811.%20子域名访问计数)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [计数](https://leetcode-cn.com/tag/counting) |
|[855](https://leetcode-cn.com/problems/exam-room)|[考场就座](https://github.com/KamToHung/leetcode/tree/main/算法/855.%20考场就座)|中等|[设计](https://leetcode-cn.com/tag/design) [有序集合](https://leetcode-cn.com/tag/ordered-set) |
|[872](https://leetcode-cn.com/problems/leaf-similar-trees)|[叶子相似的树](https://github.com/KamToHung/leetcode/tree/main/算法/872.%20叶子相似的树)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[897](https://leetcode-cn.com/problems/increasing-order-search-tree)|[递增顺序搜索树](https://github.com/KamToHung/leetcode/tree/main/算法/897.%20递增顺序搜索树)|简单|[栈](https://leetcode-cn.com/tag/stack) [树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[915](https://leetcode-cn.com/problems/partition-array-into-disjoint-intervals)|[分割数组](https://github.com/KamToHung/leetcode/tree/main/算法/915.%20分割数组)|中等|[数组](https://leetcode-cn.com/tag/array) |
|[921](https://leetcode-cn.com/problems/minimum-add-to-make-parentheses-valid)|[使括号有效的最少添加](https://github.com/KamToHung/leetcode/tree/main/算法/921.%20使括号有效的最少添加)|中等|[栈](https://leetcode-cn.com/tag/stack) [贪心](https://leetcode-cn.com/tag/greedy) [字符串](https://leetcode-cn.com/tag/string) |
|[934](https://leetcode-cn.com/problems/shortest-bridge)|[最短的桥](https://github.com/KamToHung/leetcode/tree/main/算法/934.%20最短的桥)|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[938](https://leetcode-cn.com/problems/range-sum-of-bst)|[二叉搜索树的范围和](https://github.com/KamToHung/leetcode/tree/main/算法/938.%20二叉搜索树的范围和)|简单|[树](https://leetcode-cn.com/tag/tree) [深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [二叉搜索树](https://leetcode-cn.com/tag/binary-search-tree) [二叉树](https://leetcode-cn.com/tag/binary-tree) |
|[1004](https://leetcode-cn.com/problems/max-consecutive-ones-iii)|[最大连续1的个数 III](https://github.com/KamToHung/leetcode/tree/main/算法/1004.%20最大连续1的个数%20III)|中等|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) [前缀和](https://leetcode-cn.com/tag/prefix-sum) [滑动窗口](https://leetcode-cn.com/tag/sliding-window) |
|[1081](https://leetcode-cn.com/problems/smallest-subsequence-of-distinct-characters)|[不同字符的最小子序列](https://github.com/KamToHung/leetcode/tree/main/算法/1081.%20不同字符的最小子序列)|中等|[栈](https://leetcode-cn.com/tag/stack) [贪心](https://leetcode-cn.com/tag/greedy) [字符串](https://leetcode-cn.com/tag/string) [单调栈](https://leetcode-cn.com/tag/monotonic-stack) |
|[1106](https://leetcode-cn.com/problems/parsing-a-boolean-expression)|[解析布尔表达式](https://github.com/KamToHung/leetcode/tree/main/算法/1106.%20解析布尔表达式)|困难|[栈](https://leetcode-cn.com/tag/stack) [递归](https://leetcode-cn.com/tag/recursion) [字符串](https://leetcode-cn.com/tag/string) |myba
|[1124](https://leetcode-cn.com/problems/longest-well-performing-interval)|[表现良好的最长时间段](https://github.com/KamToHung/leetcode/tree/main/算法/1124.%20表现良好的最长时间段)|中等|[栈](https://leetcode-cn.com/tag/stack) [数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [前缀和](https://leetcode-cn.com/tag/prefix-sum) [单调栈](https://leetcode-cn.com/tag/monotonic-stack) |
|[1137](https://leetcode-cn.com/problems/n-th-tribonacci-number)|[第 N 个泰波那契数](https://github.com/KamToHung/leetcode/tree/main/算法/1137.%20第%20N%20个泰波那契数)|简单|[记忆化搜索](https://leetcode-cn.com/tag/memoization) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[1138](https://leetcode-cn.com/problems/alphabet-board-path)|[字母板上的路径](https://github.com/KamToHung/leetcode/tree/main/算法/1138.%20字母板上的路径)|中等|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) |
|[1223](https://leetcode-cn.com/problems/dice-roll-simulation)|[掷骰子模拟](https://github.com/KamToHung/leetcode/tree/main/算法/1223.%20掷骰子模拟)|困难|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[1233](https://leetcode-cn.com/problems/remove-sub-folders-from-the-filesystem)|[删除子文件夹](https://github.com/KamToHung/leetcode/tree/main/算法/1233.%20删除子文件夹)|中等|[字典树](https://leetcode-cn.com/tag/trie) [数组](https://leetcode-cn.com/tag/array) [字符串](https://leetcode-cn.com/tag/string) |
|[1237](https://leetcode-cn.com/problems/find-positive-integer-solution-for-a-given-equation)|[找出给定方程的正整数解](https://github.com/KamToHung/leetcode/tree/main/算法/1237.%20找出给定方程的正整数解)|中等|[数学](https://leetcode-cn.com/tag/math) [双指针](https://leetcode-cn.com/tag/two-pointers) [二分查找](https://leetcode-cn.com/tag/binary-search) [交互](https://leetcode-cn.com/tag/interactive) |
|[1486](https://leetcode-cn.com/problems/xor-operation-in-an-array)|[数组异或操作](https://github.com/KamToHung/leetcode/tree/main/算法/1486.%20数组异或操作)|简单|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [数学](https://leetcode-cn.com/tag/math) |
|[1053](https://leetcode-cn.com/problems/previous-permutation-with-one-swap)|[交换一次的先前排列](https://github.com/KamToHung/leetcode/tree/main/算法/1053.%20交换一次的先前排列)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) |
|[1620](https://leetcode-cn.com/problems/coordinate-with-maximum-network-quality)|[网络信号最好的坐标](https://github.com/KamToHung/leetcode/tree/main/算法/1620.%20网络信号最好的坐标)|中等|[数组](https://leetcode-cn.com/tag/array) [枚举](https://leetcode-cn.com/tag/enumeration) |
|[1637](https://leetcode-cn.com/problems/widest-vertical-area-between-two-points-containing-no-points)|[两点之间不包含任何点的最宽垂直面积](https://github.com/KamToHung/leetcode/tree/main/算法/1637.%20两点之间不包含任何点的最宽垂直面积)|中等|[数组](https://leetcode-cn.com/tag/array) [排序](https://leetcode-cn.com/tag/sorting) |
|[1658](https://leetcode-cn.com/problems/minimum-operations-to-reduce-x-to-zero)|[将 x 减到 0 的最小操作数](https://github.com/KamToHung/leetcode/tree/main/算法/1658.%20将%20x%20减到%200%20的最小操作数)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [二分查找](https://leetcode-cn.com/tag/binary-search) [前缀和](https://leetcode-cn.com/tag/prefix-sum) [滑动窗口](https://leetcode-cn.com/tag/sliding-window) |
|[1662](https://leetcode-cn.com/problems/check-if-two-string-arrays-are-equivalent)|[检查两个字符串数组是否相等](https://github.com/KamToHung/leetcode/tree/main/算法/1662.%20检查两个字符串数组是否相等)|简单|[数组](https://leetcode-cn.com/tag/array) [字符串](https://leetcode-cn.com/tag/string) |
|[1663](https://leetcode-cn.com/problems/smallest-string-with-a-given-numeric-value)|[具有给定数值的最小字符串](https://github.com/KamToHung/leetcode/tree/main/算法/1663.%20具有给定数值的最小字符串)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [字符串](https://leetcode-cn.com/tag/string) |
|[1664](https://leetcode-cn.com/problems/ways-to-make-a-fair-array)|[生成平衡数组的方案数](https://github.com/KamToHung/leetcode/tree/main/算法/1664.%20生成平衡数组的方案数)|中等|[数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[1668](https://leetcode-cn.com/problems/maximum-repeating-substring)|[最大重复子字符串](https://github.com/KamToHung/leetcode/tree/main/算法/1668.%20最大重复子字符串)|简单|[字符串](https://leetcode-cn.com/tag/string) [字符串匹配](https://leetcode-cn.com/tag/string-matching) |
|[1669](https://leetcode-cn.com/problems/merge-in-between-linked-lists)|[合并两个链表](https://github.com/KamToHung/leetcode/tree/main/算法/1669.%20合并两个链表)|中等|[链表](https://leetcode-cn.com/tag/linked-list) |
|[1739](https://leetcode-cn.com/problems/building-boxes)|[放置盒子](https://github.com/KamToHung/leetcode/tree/main/算法/1739.%20放置盒子)|困难|[贪心](https://leetcode-cn.com/tag/greedy) [数学](https://leetcode-cn.com/tag/math) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[1750](https://leetcode-cn.com/problems/minimum-length-of-string-after-deleting-similar-ends)|[删除字符串两端相同字符后的最短长度](https://github.com/KamToHung/leetcode/tree/main/算法/1750.%20删除字符串两端相同字符后的最短长度)|中等|[双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) |
|[1754](https://leetcode-cn.com/problems/largest-merge-of-two-strings)|[构造字典序最大的合并字符串](https://github.com/KamToHung/leetcode/tree/main/算法/1754.%20构造字典序最大的合并字符串)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) |
|[1759](https://leetcode-cn.com/problems/count-number-of-homogenous-substrings)|[统计同构子字符串的数目](https://github.com/KamToHung/leetcode/tree/main/算法/1759.%20统计同构子字符串的数目)|中等|[数学](https://leetcode-cn.com/tag/math) [字符串](https://leetcode-cn.com/tag/string) |
|[1797](https://leetcode-cn.com/problems/design-authentication-manager)|[设计一个验证系统](https://github.com/KamToHung/leetcode/tree/main/算法/1797.%20设计一个验证系统)|中等|[设计](https://leetcode-cn.com/tag/design) [哈希表](https://leetcode-cn.com/tag/hash-table) |
|[1798](https://leetcode-cn.com/problems/maximum-number-of-consecutive-values-you-can-make)|[你能构造出连续值的最大数目](https://github.com/KamToHung/leetcode/tree/main/算法/1798.%20你能构造出连续值的最大数目)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) |
|[1802](https://leetcode-cn.com/problems/maximum-value-at-a-given-index-in-a-bounded-array)|[有界数组中指定下标处的最大值](https://github.com/KamToHung/leetcode/tree/main/算法/1802.%20有界数组中指定下标处的最大值)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[1803](https://leetcode-cn.com/problems/count-pairs-with-xor-in-a-range)|[统计异或值在范围内的数对有多少](https://github.com/KamToHung/leetcode/tree/main/算法/1803.%20统计异或值在范围内的数对有多少)|困难|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [字典树](https://leetcode-cn.com/tag/trie) [数组](https://leetcode-cn.com/tag/array) |
|[1806](https://leetcode-cn.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation)|[还原排列的最少操作步数](https://github.com/KamToHung/leetcode/tree/main/算法/1806.%20还原排列的最少操作步数)|中等|[数组](https://leetcode-cn.com/tag/array) [数学](https://leetcode-cn.com/tag/math) [模拟](https://leetcode-cn.com/tag/simulation) |
|[1807](https://leetcode-cn.com/problems/evaluate-the-bracket-pairs-of-a-string)|[替换字符串中的括号内容](https://github.com/KamToHung/leetcode/tree/main/算法/1807.%20替换字符串中的括号内容)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) |
|[1813](https://leetcode-cn.com/problems/sentence-similarity-iii)|[句子相似性 III](https://github.com/KamToHung/leetcode/tree/main/算法/1813.%20句子相似性%20III)|中等|[数组](https://leetcode-cn.com/tag/array) [双指针](https://leetcode-cn.com/tag/two-pointers) [字符串](https://leetcode-cn.com/tag/string) |
|[1814](https://leetcode-cn.com/problems/count-nice-pairs-in-an-array)|[统计一个数组中好对子的数目](https://github.com/KamToHung/leetcode/tree/main/算法/1814.%20统计一个数组中好对子的数目)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [数学](https://leetcode-cn.com/tag/math) [计数](https://leetcode-cn.com/tag/counting) |
|[1815](https://leetcode-cn.com/problems/maximum-number-of-groups-getting-fresh-donuts)|[得到新鲜甜甜圈的最多组数](https://github.com/KamToHung/leetcode/tree/main/算法/1815.%20得到新鲜甜甜圈的最多组数)|困难|[位运算](https://leetcode-cn.com/tag/bit-manipulation) [记忆化搜索](https://leetcode-cn.com/tag/memoization) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) [状态压缩](https://leetcode-cn.com/tag/bitmask) |
|[1817](https://leetcode-cn.com/problems/finding-the-users-active-minutes)|[查找用户活跃分钟数](https://github.com/KamToHung/leetcode/tree/main/算法/1817.%20查找用户活跃分钟数)|中等|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) |
|[1819](https://leetcode-cn.com/problems/number-of-different-subsequences-gcds)|[序列中不同最大公约数的数目](https://github.com/KamToHung/leetcode/tree/main/算法/1819.%20序列中不同最大公约数的数目)|困难|[数组](https://leetcode-cn.com/tag/array) [数学](https://leetcode-cn.com/tag/math) [计数](https://leetcode-cn.com/tag/counting) [数论](https://leetcode-cn.com/tag/number-theory) |
|[1822](https://leetcode-cn.com/problems/sign-of-the-product-of-an-array)|[数组元素积的符号](https://github.com/KamToHung/leetcode/tree/main/算法/1822.%20数组元素积的符号)|简单|[数组](https://leetcode-cn.com/tag/array) [数学](https://leetcode-cn.com/tag/math) |
|[1824](https://leetcode-cn.com/problems/minimum-sideway-jumps)|[最少侧跳次数](https://github.com/KamToHung/leetcode/tree/main/算法/1824.%20最少侧跳次数)|中等|[贪心](https://leetcode-cn.com/tag/greedy) [数组](https://leetcode-cn.com/tag/array) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[1825](https://leetcode-cn.com/problems/finding-mk-average)|[求出 MK 平均值](https://github.com/KamToHung/leetcode/tree/main/算法/1825.%20求出%20MK%20平均值)|困难|[设计](https://leetcode-cn.com/tag/design) [队列](https://leetcode-cn.com/tag/queue) [有序集合](https://leetcode-cn.com/tag/ordered-set) [堆（优先队列）](https://leetcode-cn.com/tag/heap-priority-queue) |
|[1828](https://leetcode-cn.com/problems/queries-on-number-of-points-inside-a-circle)|[统计一个圆中点的数目](https://github.com/KamToHung/leetcode/tree/main/算法/1828.%20统计一个圆中点的数目)|中等|[几何](https://leetcode-cn.com/tag/geometry) [数组](https://leetcode-cn.com/tag/array) [数学](https://leetcode-cn.com/tag/math) |
|[1926](https://leetcode-cn.com/problems/nearest-exit-from-entrance-in-maze)|[迷宫中离入口最近的出口](https://github.com/KamToHung/leetcode/tree/main/算法/1926.%20迷宫中离入口最近的出口)|中等|[广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[2011](https://leetcode-cn.com/problems/final-value-of-variable-after-performing-operations)|[执行操作后的变量值](https://github.com/KamToHung/leetcode/tree/main/算法/2011.%20执行操作后的变量值)|简单|[数组](https://leetcode-cn.com/tag/array) [字符串](https://leetcode-cn.com/tag/string) [模拟](https://leetcode-cn.com/tag/simulation) |
|[2018](https://leetcode-cn.com/problems/check-if-word-can-be-placed-in-crossword)|[判断单词是否能放入填字游戏内](https://github.com/KamToHung/leetcode/tree/main/算法/2018.%20判断单词是否能放入填字游戏内)|中等|[数组](https://leetcode-cn.com/tag/array) [枚举](https://leetcode-cn.com/tag/enumeration) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[2022](https://leetcode-cn.com/problems/convert-1d-array-into-2d-array)|[将一维数组转变成二维数组](https://github.com/KamToHung/leetcode/tree/main/算法/2022.%20将一维数组转变成二维数组)|简单|[数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) [模拟](https://leetcode-cn.com/tag/simulation) |
|[2027](https://leetcode-cn.com/problems/minimum-moves-to-convert-string)|[转换字符串的最少操作次数](https://github.com/KamToHung/leetcode/tree/main/算法/2027.%20转换字符串的最少操作次数)|简单|[贪心](https://leetcode-cn.com/tag/greedy) [字符串](https://leetcode-cn.com/tag/string) |
|[2032](https://leetcode-cn.com/problems/two-out-of-three)|[至少在两个数组中出现的值](https://github.com/KamToHung/leetcode/tree/main/算法/2032.%20至少在两个数组中出现的值)|简单|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) |
|[2037](https://leetcode-cn.com/problems/minimum-number-of-moves-to-seat-everyone)|[使每位学生都有座位的最少移动次数](https://github.com/KamToHung/leetcode/tree/main/算法/2037.%20使每位学生都有座位的最少移动次数)|简单|[数组](https://leetcode-cn.com/tag/array) [排序](https://leetcode-cn.com/tag/sorting) |
|[2042](https://leetcode-cn.com/problems/check-if-numbers-are-ascending-in-a-sentence)|[检查句子中的数字是否递增](https://github.com/KamToHung/leetcode/tree/main/算法/2042.%20检查句子中的数字是否递增)|简单|[字符串](https://leetcode-cn.com/tag/string) |
|[2185](https://leetcode-cn.com/problems/counting-words-with-a-given-prefix)|[统计包含给定前缀的字符串](https://github.com/KamToHung/leetcode/tree/main/算法/2185.%20统计包含给定前缀的字符串)|简单|[数组](https://leetcode-cn.com/tag/array) [字符串](https://leetcode-cn.com/tag/string) |
|[2283](https://leetcode-cn.com/problems/check-if-number-has-equal-digit-count-and-digit-value)|[判断一个数的数字计数是否等于数位的值](https://github.com/KamToHung/leetcode/tree/main/算法/2283.%20判断一个数的数字计数是否等于数位的值)|简单|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [计数](https://leetcode-cn.com/tag/counting) |
|[2287](https://leetcode-cn.com/problems/rearrange-characters-to-make-target-string)|[重排字符形成目标字符串](https://github.com/KamToHung/leetcode/tree/main/算法/2287.%20重排字符形成目标字符串)|简单|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [计数](https://leetcode-cn.com/tag/counting) |
|[2293](https://leetcode-cn.com/problems/min-max-game)|[极大极小游戏](https://github.com/KamToHung/leetcode/tree/main/算法/2293.%20极大极小游戏)|简单|[数组](https://leetcode-cn.com/tag/array) [模拟](https://leetcode-cn.com/tag/simulation) |
|[2299](https://leetcode-cn.com/problems/strong-password-checker-ii)|[强密码检验器 II](https://github.com/KamToHung/leetcode/tree/main/算法/2299.%20强密码检验器%20II)|简单|[字符串](https://leetcode-cn.com/tag/string) |
|[2303](https://leetcode-cn.com/problems/calculate-amount-paid-in-taxes)|[计算应缴税款总额](https://github.com/KamToHung/leetcode/tree/main/算法/2303.%20计算应缴税款总额)|简单|[数组](https://leetcode-cn.com/tag/array) [模拟](https://leetcode-cn.com/tag/simulation) |
|[2309](https://leetcode-cn.com/problems/greatest-english-letter-in-upper-and-lower-case)|[兼具大小写的最好英文字母](https://github.com/KamToHung/leetcode/tree/main/算法/2309.%20兼具大小写的最好英文字母)|简单|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) [枚举](https://leetcode-cn.com/tag/enumeration) |
|[2315](https://leetcode-cn.com/problems/count-asterisks)|[统计星号](https://github.com/KamToHung/leetcode/tree/main/算法/2315.%20统计星号)|简单|[字符串](https://leetcode-cn.com/tag/string) |
|[2319](https://leetcode-cn.com/problems/check-if-matrix-is-x-matrix)|[判断矩阵是否是一个 X 矩阵](https://github.com/KamToHung/leetcode/tree/main/算法/2319.%20判断矩阵是否是一个%20X%20矩阵)|简单|[数组](https://leetcode-cn.com/tag/array) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[2325](https://leetcode-cn.com/problems/decode-the-message)|[解密消息](https://github.com/KamToHung/leetcode/tree/main/算法/2325.%20解密消息)|简单|[哈希表](https://leetcode-cn.com/tag/hash-table) [字符串](https://leetcode-cn.com/tag/string) |
|[2331](https://leetcode-cn.com/problems/evaluate-boolean-binary-tree)|[计算布尔二叉树的值](https://github.com/KamToHung/leetcode/tree/main/算法/2331.%20计算布尔二叉树的值)|简单||
|[2335](https://leetcode-cn.com/problems/minimum-amount-of-time-to-fill-cups)|[装满杯子需要的最短总时长](https://github.com/KamToHung/leetcode/tree/main/算法/2335.%20装满杯子需要的最短总时长)|简单||
|[剑指 Offer 03](https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof)|[数组中重复的数字](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2003.%20数组中重复的数字)|简单|[数组](https://leetcode-cn.com/tag/array) [哈希表](https://leetcode-cn.com/tag/hash-table) [排序](https://leetcode-cn.com/tag/sorting) |
|[剑指 Offer 04](https://leetcode-cn.com/problems/er-wei-shu-zu-zhong-de-cha-zhao-lcof)|[二维数组中的查找](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2004.%20二维数组中的查找)|中等|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) [分治](https://leetcode-cn.com/tag/divide-and-conquer) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[剑指 Offer 05](https://leetcode-cn.com/problems/ti-huan-kong-ge-lcof)|[替换空格](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2005.%20替换空格)|简单|[字符串](https://leetcode-cn.com/tag/string) |
|[剑指 Offer 06](https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof)|[从尾到头打印链表](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2006.%20从尾到头打印链表)|简单|[栈](https://leetcode-cn.com/tag/stack) [递归](https://leetcode-cn.com/tag/recursion) [链表](https://leetcode-cn.com/tag/linked-list) [双指针](https://leetcode-cn.com/tag/two-pointers) |
|[剑指 Offer 09](https://leetcode-cn.com/problems/yong-liang-ge-zhan-shi-xian-dui-lie-lcof)|[用两个栈实现队列](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2009.%20用两个栈实现队列)|简单|[栈](https://leetcode-cn.com/tag/stack) [设计](https://leetcode-cn.com/tag/design) [队列](https://leetcode-cn.com/tag/queue) |
|[剑指 Offer 10- I](https://leetcode-cn.com/problems/fei-bo-na-qi-shu-lie-lcof)|[斐波那契数列](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2010-%20I.%20斐波那契数列)|简单|[记忆化搜索](https://leetcode-cn.com/tag/memoization) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[剑指 Offer 10- II](https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof)|[青蛙跳台阶问题](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2010-%20II.%20青蛙跳台阶问题)|简单|[记忆化搜索](https://leetcode-cn.com/tag/memoization) [数学](https://leetcode-cn.com/tag/math) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |
|[剑指 Offer 11](https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof)|[旋转数组的最小数字](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2011.%20旋转数组的最小数字)|简单|[数组](https://leetcode-cn.com/tag/array) [二分查找](https://leetcode-cn.com/tag/binary-search) |
|[剑指 Offer 12](https://leetcode-cn.com/problems/ju-zhen-zhong-de-lu-jing-lcof)|[矩阵中的路径](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2012.%20矩阵中的路径)|中等|[数组](https://leetcode-cn.com/tag/array) [回溯](https://leetcode-cn.com/tag/backtracking) [矩阵](https://leetcode-cn.com/tag/matrix) |
|[剑指 Offer 13](https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof)|[机器人的运动范围](https://github.com/KamToHung/leetcode/tree/main/剑指OFFER/剑指%20Offer%2013.%20机器人的运动范围)|中等|[深度优先搜索](https://leetcode-cn.com/tag/depth-first-search) [广度优先搜索](https://leetcode-cn.com/tag/breadth-first-search) [动态规划](https://leetcode-cn.com/tag/dynamic-programming) |