interview

KO | EN

gitlite — search

#javascript #python #react #typescript #android #machine-learning #rust #nodejs #macos #java #cli #awesome-list #vue #ios

(★ 33)

总结一下面试常考的算法题，希望可以帮助每一位想要提升自己面试能力的同学。对于每一道算法题会总结代码、时间复杂度以及一些好的blog

interview 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# ambition
# 总结一下面试常考的算法题
希望可以帮助每一位想要提升自己面试能力的同学。

对于每一道算法题会**总结代码、时间复杂度**以及一些**好的blog**

---

## 排序（sort）
[LintCode 463 Sort Integers](https://github.com/only-you/-/blob/master/sort/sort-integers.md)

[LintCode 464 Sort Integers II](https://github.com/only-you/-/blob/master/sort/sort_integers2.md)

[LeetCode 148 Sort List](https://github.com/only-you/-/blob/master/sort/sortList.md)

[LeetCode 215 Kth Largest Element in an Array](https://github.com/only-you/-/blob/master/sort/kthLargest.md)

[LintCode 532 Reverse Pairs](https://github.com/only-you/-/blob/master/sort/reversePairs.md)

[LeetCode 315 Count of Smaller Numbers After Self](https://github.com/only-you/-/blob/master/sort/315.md)

[LeetCode 207 Course Schedule](https://github.com/only-you/-/blob/master/sort/topoSort1.md)

[LeetCode 210 Course Schedule II](https://github.com/only-you/-/blob/master/sort/topoSort2.md)

## 数组（array）
[LeetCode 28 Implement strStr()](https://github.com/only-you/-/blob/master/array/strStr.md)

[LeetCode 1 Two Sum](https://github.com/only-you/-/blob/master/array/twoSum.md)

[LeetCode 189 Rotate Array](https://github.com/only-you/-/blob/master/array/rotate.md)

[LintCode 31 Partition Array](https://github.com/only-you/-/blob/master/array/partition.md)

[LintCode 373 Partition Array by Odd and Even](https://github.com/only-you/-/blob/master/array/oddEven.md)

[LintCode 144 Interleaving Positive and Negative Numbers](https://github.com/only-you/-/blob/master/array/interleave.md)

[LeetCode 54 Spiral Matrix](https://github.com/only-you/interview/blob/master/array/matrix.md)

[LeetCode 59 Spiral Matrix II](https://github.com/only-you/interview/blob/master/array/matrixii.md)

[LeetCode 53 Maximum Subarray](https://github.com/only-you/interview/blob/master/array/53.md)

[LeetCode 152 Maximum Product Subarray](https://github.com/only-you/interview/blob/master/array/152.md)

[LintCode 138 Subarray Sum](https://github.com/only-you/interview/blob/master/array/Subarray.md)

[LintCode 139 Subarray Sum Closest](https://github.com/only-you/interview/blob/master/array/139.md)

[LeetCode 392 Is Subsequence](https://github.com/only-you/interview/blob/master/array/392.md)

[LeetCode 136 Single Number](https://github.com/only-you/interview/blob/master/array/Single.md)

[LeetCode 137 Single Number II](https://github.com/only-you/interview/blob/master/array/137.md)

[LeetCode 260 Single Number III](https://github.com/only-you/interview/blob/master/array/260.md)

[LeetCode 263 Ugly Number](https://github.com/only-you/interview/blob/master/array/263.md)

[LeetCode 264 Ugly Number II](https://github.com/only-you/interview/blob/master/array/264.md)

[LeetCode 295 Find Median from Data Stream——hard](https://github.com/only-you/interview/blob/master/array/295.md)

[LeetCode 4 Median of Two Sorted Arrays——very hard](https://github.com/only-you/interview/blob/master/array/4.md)

[LeetCode 239 Sliding Window Maximum——hard](https://github.com/only-you/interview/blob/master/array/239.md)

[LeetCode 480 Sliding Window Median——hard](https://github.com/only-you/interview/blob/master/array/480.md)

[LintCode 130 Heapify——medium](https://github.com/only-you/interview/blob/master/array/130.md)

[LeetCode 347 Top K Frequent Elements——medium](https://github.com/only-you/interview/blob/master/array/347.md)

[LeetCode 128 Longest Consecutive Sequence——hard](https://github.com/only-you/interview/blob/master/array/128.md)

## 双指针（two pointers）
[LeetCode 15 3Sum——medium](https://github.com/only-you/interview/blob/master/twoPointers/15.md)

[LeetCode 16 3Sum Closest——medium](https://github.com/only-you/interview/blob/master/twoPointers/16.md)

[LeetCode 18 4Sum——medium](https://github.com/only-you/interview/blob/master/twoPointers/18.md)

[LeetCode 42 Trapping Rain Water——hard](https://github.com/only-you/interview/blob/master/twoPointers/42.md)

## 链表（linkedList）
```
注意以下两点：
1、当你预估到返回的链表头结点可能跟原有的链表头节点不一样时，建一个虚拟节点dummy，值任意，比如0，最后返回的新的链表头结点就是dummy.next，这一条非常好用！
2、当操作一个链表节点的时候，时刻想一想要访问的链表节点是否为null
```
[LeetCode 206 Reverse Linked List——easy](https://github.com/only-you/interview/blob/master/linkedList/206.md)

[LeetCode 86 Partition List——medium](https://github.com/only-you/interview/blob/master/linkedList/86.md)

[LeetCode 92 Reverse Linked List II——medium](https://github.com/only-you/interview/blob/master/linkedList/92.md)

[LeetCode 83 Remove Duplicates from Sorted List——easy](https://github.com/only-you/interview/blob/master/linkedList/83.md)

[LeetCode 82 Remove Duplicates from Sorted List II——medium](https://github.com/only-you/interview/blob/master/linkedList/82.md)

[LeetCode 237 Delete Node in a Linked List——easy](https://github.com/only-you/interview/blob/master/linkedList/237.md)

[LeetCode 19 Remove Nth Node From End of List——medium](https://github.com/only-you/interview/blob/master/linkedList/19.md)

[LeetCode 61 Rotate List——medium](https://github.com/only-you/interview/blob/master/linkedList/61.md)

[LeetCode 203 Remove Linked List Elements——easy](https://github.com/only-you/interview/blob/master/linkedList/203.md)

[LeetCode 2 Add Two Numbers——medium](https://github.com/only-you/interview/blob/master/linkedList/2.md)

[LeetCode 445 Add Two Numbers II——medium](https://github.com/only-you/interview/blob/master/linkedList/445.md)

[LeetCode 328 Odd Even Linked List](https://github.com/only-you/interview/blob/master/linkedList/328.md)

[LeetCode 234 Palindrome Linked List](https://github.com/only-you/interview/blob/master/linkedList/234.md)

[LeetCode 24 Swap Nodes in Pairs](https://github.com/only-you/interview/blob/master/linkedList/24.md)

[LeetCode 160 Intersection of Two Linked Lists](https://github.com/only-you/interview/blob/master/linkedList/160.md)

[LeetCode 141 Linked List Cycle——easy](https://github.com/only-you/interview/blob/master/linkedList/141.md)

[LeetCode 142 Linked List Cycle II——medium](https://github.com/only-you/interview/blob/master/linkedList/142.md)

[LeetCode 21 Merge Two Sorted Lists——easy](https://github.com/only-you/interview/blob/master/linkedList/21.md)

[LeetCode 23 Merge k Sorted Lists——hard](https://github.com/only-you/interview/blob/master/linkedList/23.md)

[LeetCode 138 Copy List with Random Pointer——medium](https://github.com/only-you/interview/blob/master/linkedList/138.md)

[LeetCode 143 Reorder List——medium](https://github.com/only-you/interview/blob/master/linkedList/143.md)

[LeetCode 25 Reverse Nodes in k-Group——hard](https://github.com/only-you/interview/blob/master/linkedList/25.md)

[LeetCode 146 LRU Cache——hard](https://github.com/only-you/interview/blob/master/linkedList/146.md)

## 二分（binary search）
```
需要注意的点有：
1、start 、end在while循环的条件、到底是start<end、还是start<=end；要仔细举例确认
2、还有mid值的计算 mid = start + (end-start)/2; 有时候为了跳出循环；可以 mid = start + (end-start)/2 + 1;
```
[LeetCode 35 Search Insert Position——easy](https://github.com/only-you/interview/blob/master/binarySearch/35.md)

[LeetCode 34 Find First and Last Position of Element in Sorted Array——medium](https://github.com/only-you/interview/blob/master/binarySearch/34.md)

[LeetCode 278 First Bad Version——easy](https://github.com/only-you/interview/blob/master/binarySearch/278.md)

[LeetCode 162 Find Peak Element——medium](https://github.com/only-you/interview/blob/master/binarySearch/162.md)

[LeetCode 154 Find Minimum in Rotated Sorted Array II——hard](https://github.com/only-you/interview/blob/master/binarySearch/154.md)

[LeetCode 153 Find Minimum in Rotated Sorted Array——medium](https://github.com/only-you/interview/blob/master/binarySearch/153.md)

[LeetCode 240 Search a 2D Matrix II——medium](https://github.com/only-you/interview/blob/master/binarySearch/240.md)

[LeetCode 74 Search a 2D Matrix——medium](https://github.com/only-you/interview/blob/master/binarySearch/74.md)

[LeetCode 33 Search in Rotated Sorted Array——medium](https://github.com/only-you/interview/blob/master/binarySearch/33.md)

[LeetCode 81 Search in Rotated Sorted Array II——medium](https://github.com/only-you/interview/blob/master/binarySearch/81.md)

[LeetCode 378 Kth Smallest Element in a Sorted Matrix——medium](https://github.com/only-you/interview/blob/master/binarySearch/378.md)

[LeetCode 4 Median of Two Sorted Arrays](https://github.com/only-you/interview/blob/master/array/4.md)

## 栈（stack）
[LeetCode 155 Min Stack——easy](https://github.com/only-you/interview/blob/master/stack/155.md)

[LeetCode 232 Implement Queue using Stacks——easy](https://github.com/only-you/interview/blob/master/stack/232.md)

[LeetCode 225 Implement Stack using Queues——easy](https://github.com/only-you/interview/blob/master/stack/225.md)

[LeetCode 84 Largest Rectangle in Histogram——hard](https://github.com/only-you/interview/blob/master/stack/84.md)

[LeetCode 394 Decode String——medium](https://github.com/only-you/interview/blob/master/stack/394.md)

[LeetCode 85 Maximal Rectangle——hard](https://github.com/only-you/interview/blob/master/stack/85.md)

## 广度优先搜索（BFS）
[LeetCode 103 Binary Tree Zigzag Level Order Traversal——medium](https://github.com/only-you/interview/blob/master/bfs/103.md)

[LeetCode 102 Binary Tree Level Order Traversal——medium](https://github.com/only-you/interview/blob/master/bfs/102.md)

[LeetCode 107 Binary Tree Level Order Traversal II——easy](https://github.com/only-you/interview/blob/master/bfs/107.md)

## 深度优先搜索（DFS）
[LeetCode 200 Number of Islands——medium](https://github.com/only-you/interview/blob/master/dfs/200.md)

[LeetCode 144 Binary Tree Preorder Traversal——medium](https://github.com/only-you/interview/blob/master/dfs/144.md)

[LeetCode 94 Binary Tree Inorder Traversal——medium](https://github.com/only-you/interview/blob/master/dfs/94.md)

[LeetCode 145 Binary Tree Postorder Traversal——hard](https://github.com/only-you/interview/blob/master/dfs/145.md)

[LeetCode 105 Construct Binary Tree from Preorder and Inorder Traversal——medium](https://github.com/only-you/interview/blob/master/dfs/105.md)

[LeetCode 106 Construct Binary Tree from Inorder and Postorder Traversal——medium](https://github.com/only-you/interview/blob/master/dfs/106.md)

[LeetCode 110 Balanced Binary Tree——easy](https://github.com/only-you/interview/blob/master/dfs/110.md)

[LeetCode 98 Validate Binary Search Tree——medium](https://github.com/only-you/interview/blob/master/dfs/98.md)

[LeetCode 236 Lowest Common Ancestor of a Binary Tree——medium](https://github.com/only-you/interview/blob/master/dfs/236.md)

[LeetCode 104 Maximum Depth of Binary Tree——easy](https://github.com/only-you/interview/blob/master/dfs/104.md)

[LeetCode 111 Minimum Depth of Binary Tree——easy](https://github.com/only-you/interview/blob/master/dfs/111.md)

[LeetCode 257 Binary Tree Paths——easy](https://github.com/only-you/interview/blob/master/dfs/257.md)

[LeetCode 112 Path Sum——easy](https://github.com/only-you/interview/blob/master/dfs/112.md)

[LeetCode 113 Path Sum II——medium](https://github.com/only-you/interview/blob/master/dfs/113.md)

[LeetCode 437 Path Sum III——easy](https://github.com/only-you/interview/blob/master/dfs/437.md)

[LeetCode 114 Flatten Binary Tree to Linked List——medium](https://github.com/only-you/interview/blob/master/dfs/114.md)

[LeetCode 101 Symmetric Tree——easy](https://github.com/only-you/interview/blob/master/dfs/101.md)

[LintCode 375 Clone Binary Tree——easy](https://github.com/only-you/interview/blob/master/dfs/375.md)

[LintCode 595 Binary Tree Longest Consecutive Sequence——easy](https://github.com/only-you/interview/blob/master/dfs/595.md)

[LintCode 614 Binary Tree Longest Consecutive Sequence II——medium](https://github.com/only-you/interview/blob/master/dfs/614.md)

[LeetCode 572 Subtree of Another Tree——easy](https://github.com/only-you/interview/blob/master/dfs/572.md)

[leetcode 226. Invert Binary Tree——easy](https://github.com/only-you/interview/blob/master/dfs/226.md)

[LeetCode 124 Binary Tree Maximum Path Sum——hard](https://github.com/only-you/interview/blob/master/dfs/124.md)

[LeetCode 109 Convert Sorted List to Binary Search Tree——medium](https://github.com/only-you/interview/blob/master/dfs/109.md)

[LintCode 378 Convert Binary Search Tree to Doubly Linked List——medium](https://github.com/only-you/interview/blob/master/dfs/378.md)

### 回溯法（backtracking）
[LeetCode 494 Target Sum——medium](https://github.com/only-you/interview/blob/master/dfs/494.md)

[LeetCode 78 Subsets——medium](https://github.com/only-you/interview/blob/master/dfs/78.md)

[LeetCode 90 Subsets II——medium](https://github.com/only-you/interview/blob/master/dfs/90.md)

[LeetCode 39 Combination Sum——medium](https://github.com/only-you/interview/blob/master/dfs/39.md)

[LeetCode 40 Combination Sum II——medium](https://github.com/only-you/interview/blob/master/dfs/40.md)

[LeetCode 46 Permutations——medium](https://github.com/only-you/interview/blob/master/dfs/46.md)

[LeetCode 47 Permutations II——medium](https://github.com/only-you/interview/blob/master/dfs/47.md)

[LeetCode 131 Palindrome Partitioning——medium](https://github.com/only-you/interview/blob/master/dfs/131.md)

## 动态规划（dynamic programming）
[LeetCode 70 Climbing Stairs——easy](https://github.com/only-you/interview/blob/master/dynamicProgramming/70.md)

[LeetCode 62 Unique Paths——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/62.md)

[LeetCode 63 Unique Paths II——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/63.md)

[LeetCode 64 Minimum Path Sum——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/64.md)

[LeetCode 120 Triangle——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/120.md)

[LeetCode 198 House Robber——easy](https://github.com/only-you/interview/blob/master/dynamicProgramming/198.md)

[	LeetCode 213 House Robber II——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/213.md)

[LeetCode 279 Perfect Squares——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/279.md)

[LeetCode 221 Maximal Square——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/221.md)

[LeetCode 300 Longest Increasing Subsequence——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/300.md)

[LeetCode 5 Longest Palindromic Substring——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/5.md)

[LeetCode 115 Distinct Subsequences——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/115.md)

[LeetCode 322 Coin Change——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/322.md)

[LeetCode 354 Russian Doll Envelopes——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/354.md)

[LeetCode 403 Frog Jump——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/403.md)

[LeetCode 72 Edit Distance——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/72.md)

[LeetCode 368 Largest Divisible Subset——medium](https://github.com/only-you/interview/blob/master/dynamicProgramming/368.md)

[LeetCode 10 Regular Expression Matching——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/10.md)

[LeetCode 329 Longest Increasing Path in a Matrix——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/329.md)

[LeetCode 97 Interleaving String——hard](https://github.com/only-you/interview/blob/master/dynamicProgramming/97.md)

## 贪心（greedy）
```
贪心算法考的非常少，面试中非常少见，因为贪心算法的数学证明是很难的，短时间你不太可能证明出来，而且面试官也大概率证不出来，只有机试中才小概率会出贪心算法题，比如头条这种。所以做了以下这几个题就行。具体原因可以看一下这个链接：https://www.jiuzhang.com/qa/2100/
```
[LintCode 46 Majority Element——easy](https://github.com/only-you/interview/blob/master/greedy/46.md)

[LeetCode 55 Jump Game——medium](https://github.com/only-you/interview/blob/master/greedy/55.md)

[LeetCode 45  Jump Game II——hard](https://github.com/only-you/interview/blob/master/greedy/45.md)

[LeetCode 134 Gas Station——medium](https://github.com/only-you/interview/blob/master/greedy/134.md)

## 数学（math）
```
一些trick题，考察数学和逻辑推理
```
[LintCode 1 A + B Problem——easy](https://github.com/only-you/interview/blob/master/math/1.md)

[LintCode 365 Count 1 in Binary——easy](https://github.com/only-you/interview/blob/master/math/365.md)

[LintCode 3 Digit Counts——medium](https://github.com/only-you/interview/blob/master/math/3.md)

[LintCode 379 Reorder array to construct the minimum number——medium](https://github.com/only-you/interview/blob/master/math/379.md)

interview

interview 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

interview

interview 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README