|
|
|
|
# LeetCode topic classification and interview questions collation
|
|
|
|
|
|
|
|
|
|
## Subject category
|
|
|
|
|
|
|
|
|
|
### Hash related
|
|
|
|
|
|
|
|
|
|
- [q1_sum of two numbers](/src/hash相关/q1_两数之和)
|
|
|
|
|
- [q387_the first unique character in the string](/src/hash相关/q387_字符串中的第一个唯一字符)
|
|
|
|
|
|
|
|
|
|
### Linked list operation
|
|
|
|
|
|
|
|
|
|
- [q2_Add two numbers](/src/链表操作/q2_两数相加)
|
|
|
|
|
- [q19_delete the Nth node from the bottom of the linked list](/src/链表操作/q19_删除链表的倒数第N个节点)
|
|
|
|
|
- [q25_k set of flipped linked lists](/src/链表操作/q25_k个一组翻转链表)
|
|
|
|
|
- [q61_rotating linked list](/src/链表操作/q61_旋转链表)
|
|
|
|
|
- [q138_copy linked list with random pointer](/src/链表操作/q138_复制带随机指针的链表)
|
|
|
|
|
- [q206_reverse linked list](/src/链表操作/q206_反转链表)
|
|
|
|
|
|
|
|
|
|
### Double pointer traversal/sliding window
|
|
|
|
|
|
|
|
|
|
- [q3_Longest substring without repeated characters](/src/双指针遍历/q3_无重复字符的最长子串)
|
|
|
|
|
- [q11_Container with the most water](/src/双指针遍历/q11_盛最多水的容器)
|
|
|
|
|
- [q15_sum of three numbers](/src/双指针遍历/q15_三数之和)
|
|
|
|
|
- [q16_closest sum of three numbers](/src/双指针遍历/q16_最接近的三数之和)
|
|
|
|
|
- [q26_delete duplicates in the sorted array](/src/双指针遍历/q26_删除排序数组中的重复项)
|
|
|
|
|
- [q42_trapping-rain-water](/src/双指针遍历/q42_接雨水)
|
|
|
|
|
- [q121_The best time to buy and sell stocks](/src/双指针遍历/q121_买卖股票的最佳时机)
|
|
|
|
|
- [q209_The smallest length sub-array](/src/双指针遍历/q209_长度最小的子数组)
|
|
|
|
|
|
|
|
|
|
### Fast and slow pointer traversal
|
|
|
|
|
|
|
|
|
|
- [q141_circular linked list](/src/快慢指针遍历/q141_环形链表)
|
|
|
|
|
- [q202_happy number](/src/快慢指针遍历/q202_快乐数)
|
|
|
|
|
- [q876_intermediate node of linked list](/src/快慢指针遍历/q876_链表的中间结点)
|
|
|
|
|
|
|
|
|
|
### Interval merge
|
|
|
|
|
|
|
|
|
|
- [q56_Merge interval](/src/区间合并/q56_合并区间)
|
|
|
|
|
|
|
|
|
|
### String manipulation
|
|
|
|
|
|
|
|
|
|
- [q6_Zigzag transformation](/src/字符串操作/q6_Z字形变换)
|
|
|
|
|
- [q14_longest common prefix](/src/字符串操作/q14_最长公共前缀)
|
|
|
|
|
- [q763_Dividing letter interval](/src/字符串操作/q763_划分字母区间)
|
|
|
|
|
|
|
|
|
|
### Digital operation
|
|
|
|
|
|
|
|
|
|
- [q7_integer inversion](/src/数字操作/q7_整数反转)
|
|
|
|
|
- [q8_string conversion integer](/src/数字操作/q8_字符串转换整数)
|
|
|
|
|
- [q9_Palindrome Number](/src/数字操作/q9_回文数)
|
|
|
|
|
- [q43_string multiplication](/src/数字操作/q43_字符串相乘)
|
|
|
|
|
- [q172_zero after factorial](/src/数字操作/q172_阶乘后的零)
|
|
|
|
|
- [q258_Add everybody](/src/数字操作/q258_各位相加)
|
|
|
|
|
|
|
|
|
|
### Array operations
|
|
|
|
|
|
|
|
|
|
- [q54_spiral matrix](/src/数组操作/q54_螺旋矩阵)
|
|
|
|
|
- [q73_Zero Matrix](/src/数组操作/q73_矩阵置零)
|
|
|
|
|
- [q78_subset](/src/数组操作/q78_子集)
|
|
|
|
|
- [q384_scrambling array](/src/数组操作/q384_打乱数组)
|
|
|
|
|
- [q581_shortest unordered continuous subarray](/src/数组操作/q581_最短无序连续子数组)
|
|
|
|
|
- [q945_Minimum increment to make the array unique](/src/数组操作/q945_使数组唯一的最小增量)
|
|
|
|
|
|
|
|
|
|
### Stack related
|
|
|
|
|
|
|
|
|
|
- [q20_valid brackets](/src/栈相关/q20_有效的括号)
|
|
|
|
|
- [q32_longest valid bracket](/src/栈相关/q32_最长有效括号)
|
|
|
|
|
- [q155_Minimal stack](/src/栈相关/q155_最小栈)
|
|
|
|
|
- [q224_basic calculator](/src/栈相关/q224_基本计算器)
|
|
|
|
|
- [q232_implement queue with stack](/src/栈相关/q232_用栈实现队列)
|
|
|
|
|
- [q316_remove duplicate letters](/src/栈相关/q316_去除重复字母)
|
|
|
|
|
|
|
|
|
|
### Heap related
|
|
|
|
|
|
|
|
|
|
- [q215_the Kth largest element in the array](/src/堆相关/q215_数组中的第K个最大元素)
|
|
|
|
|
- [q347_top K high frequency elements](/src/堆相关/q347_前K个高频元素)
|
|
|
|
|
|
|
|
|
|
### Recursion
|
|
|
|
|
|
|
|
|
|
- [q21_merge two ordered linked lists](/src/递归/q21_合并两个有序链表)
|
|
|
|
|
- [q101_symmetric binary tree](/src/递归/q101_对称二叉树)
|
|
|
|
|
- [q104_Maximum Depth of Binary Tree](/src/递归/q104_二叉树的最大深度)
|
|
|
|
|
- [q226_flip binary tree](/src/递归/q226_翻转二叉树)
|
|
|
|
|
- [q236_The nearest common ancestor of the binary tree](/src/递归/q236_二叉树的最近公共祖先)
|
|
|
|
|
|
|
|
|
|
### Divide and Conquer/Dichotomy
|
|
|
|
|
|
|
|
|
|
- [q23_Merge K sorted lists](/src/分治法/q23_合并K个排序链表)
|
|
|
|
|
- [q33_Search rotating sorted array](/src/分治法/q33_搜索旋转排序数组)
|
|
|
|
|
- [q34_Find the first and last position of an element in the sorted array](/src/分治法/q34_在排序数组中查找元素的第一个和最后一个位置)
|
|
|
|
|
|
|
|
|
|
### Dynamic Planning
|
|
|
|
|
|
|
|
|
|
- [q5_longest palindrome substring](/src/动态规划/q5_最长回文子串)
|
|
|
|
|
- [q53_Maximum Subsequence Sum](/src/动态规划/q53_最大子序和)
|
|
|
|
|
- [q62_different path](/src/动态规划/q62_不同路径)
|
|
|
|
|
- [q64_Minimum path sum](/src/动态规划/q64_最小路径和)
|
|
|
|
|
- [q70_stair climbing](/src/动态规划/q70_爬楼梯)
|
|
|
|
|
- [q118\_杨辉 Triangle](/src/动态规划/q118_杨辉三角)
|
|
|
|
|
- [q300_Longest Ascending Subsequence](/src/动态规划/q300_最长上升子序列)
|
|
|
|
|
- [q1143_longest common subsequence](/src/动态规划/q1143_最长公共子序列)
|
|
|
|
|
- [q1277_square submatrix with all 1s](/src/动态规划/q1277_统计全为1的正方形子矩阵)
|
|
|
|
|
|
|
|
|
|
### Backtracking
|
|
|
|
|
|
|
|
|
|
- [q10_regular expression matching](/src/回溯法/q10_正则表达式匹配)
|
|
|
|
|
- [q22_bracket generation](/src/回溯法/q22_括号生成)
|
|
|
|
|
- [q40_combined sum 2](/src/回溯法/q40_组合总和2)
|
|
|
|
|
- [q46_all permutation](/src/回溯法/q46_全排列)
|
|
|
|
|
|
|
|
|
|
### Tree traversal
|
|
|
|
|
|
|
|
|
|
- [q94_In-order traversal of binary tree](/src/树的遍历/q94_二叉树的中序遍历)
|
|
|
|
|
- [q102_Binary tree traversal](/src/树的遍历/q102_二叉树的层次遍历)
|
|
|
|
|
- [q110_balanced binary tree](/src/树的遍历/q110_平衡二叉树)
|
|
|
|
|
- [q144_Preorder traversal of binary tree](/src/树的遍历/q144_二叉树的前序遍历)
|
|
|
|
|
- [q145_Post-order traversal of binary tree](/src/树的遍历/q145_二叉树的后序遍历)
|
|
|
|
|
|
|
|
|
|
### Binary search tree related
|
|
|
|
|
|
|
|
|
|
- [q98_Verify Binary Search Tree](/src/二叉搜索树相关/q98_验证二叉搜索树)
|
|
|
|
|
- [q450_delete nodes in binary search tree](/src/二叉搜索树相关/q450_删除二叉搜索树中的节点)
|
|
|
|
|
- [q701_insert operation in binary search tree](/src/二叉搜索树相关/q701_二叉搜索树中的插入操作)
|
|
|
|
|
|
|
|
|
|
---
|
|
|
|
|
|
|
|
|
|
## Interview questions finishing
|
|
|
|
|
|
|
|
|
|
-[Interview Questions Finishing](/Rocket.md)
|
