总结实属不易，恳求大家给个star:star:

对于一些数据条数较多的岗位，可能会只提供考察频度大于1次的数据，基本上也够用了。

如果想了解**部门**偏爱考察的题目或按时间排序查看面试题，请移至公众号中的CodeTop小程序查询。

如果想更充分准备面试，了解部门偏爱考察的题目或时间排序查看面试题，请移至公众号中的CodeTop小程序查询。

:loudspeaker:新增[issues](https://github.com/afatcoder/LeetcodeTop/issues)，以后的issue会存放题目的来源和没有在leetcode上查到的“不明题目”。


:heartbeat:期待大家来codetop分享考到的题目，祝大家都能拿到满意的offer

:heartbeat:期待大家来在codetop中分享考到的题目，祝大家都能拿到满意的offer

:information_source:数据来源：牛客网笔经面经

:warning:若转载本文章，需注明本仓库地址哦


-[百度提前批面经原始数据，结果还在统计中...](https://github.com/afatcoder/LeetcodeTop/issues/6)

-[后端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/backend.md)

-[算法](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/algorithm.md)

-[客户端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/client.md)

-[前端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/frontend.md)

-[数据相关岗位](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/data.md)

-[测试](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/test.md)

-[后端](https://github.com/afatcoder/LeetcodeTop/blob/master/baidu/backend.md)

-[算法](https://github.com/afatcoder/LeetcodeTop/blob/master/baidu/algorithm.md)

-[客户端](https://github.com/afatcoder/LeetcodeTop/blob/master/baidu/client.md)

-[前端](https://github.com/afatcoder/LeetcodeTop/blob/master/baidu/frontend.md)

-[测试](https://github.com/afatcoder/LeetcodeTop/blob/master/baidu/test.md)

-[后端](https://github.com/afatcoder/LeetcodeTop/blob/master/bytedance/backend.md)

-[算法](https://github.com/afatcoder/LeetcodeTop/blob/master/bytedance/algorithm.md)

-[前端](https://github.com/afatcoder/LeetcodeTop/blob/master/kuaishou/frontend.md)

-[测试](https://github.com/afatcoder/LeetcodeTop/blob/master/kuaishou/test.md)

-[数据开发](https://github.com/afatcoder/LeetcodeTop/blob/master/kuaishou/data.md)

-[后端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/backend.md)

-[算法](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/algorithm.md)

-[客户端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/client.md)

-[前端](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/frontend.md)

-[数据相关岗位](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/data.md)

-[测试](https://github.com/afatcoder/LeetcodeTop/blob/master/alibaba/test.md)

| 公司| 岗位| 题目| 链接| 频度|

|----|----|-------------------------------|----------------------------------------------------------------------------------------------------------------------|----|

| 百度| 算法| 215\. 数组中的第K个最大元素|https://leetcode\-cn\.com/problems/kth\-largest\-element\-in\-an\-array/| 7|

| 百度| 算法| 142\. 环形链表 II|https://leetcode\-cn\.com/problems/linked\-list\-cycle\-ii/| 2|

| 百度| 算法| 103\. 二叉树的锯齿形层次遍历|https://leetcode\-cn\.com/problems/binary\-tree\-zigzag\-level\-order\-traversal/| 2|

| 百度| 算法| 1339\. 分裂二叉树的最大乘积|https://leetcode\-cn\.com/problems/maximum\-product\-of\-splitted\-binary\-tree/| 1|

| 百度| 算法| 101\. 对称二叉树|https://leetcode\-cn\.com/problems/symmetric\-tree/| 1|

| 百度| 算法| 46\. 全排列|https://leetcode\-cn\.com/problems/permutations/| 1|

| 百度| 算法| 53\. 最大子序和|https://leetcode\-cn\.com/problems/maximum\-subarray/| 1|

| 百度| 算法| 98\. 验证二叉搜索树|https://leetcode\-cn\.com/problems/validate\-binary\-search\-tree/| 1|

| 百度| 算法| 102\. 二叉树的层序遍历|https://leetcode\-cn\.com/problems/binary\-tree\-level\-order\-traversal/| 1|

| 百度| 算法| 62\. 不同路径|https://leetcode\-cn\.com/problems/unique\-paths/| 1|

| 百度| 算法| 69\. x 的平方根|https://leetcode\-cn\.com/problems/sqrtx/| 1|

| 百度| 算法| 208\. 实现 Trie\(前缀树\)|https://leetcode\-cn\.com/problems/implement\-trie\-prefix\-tree/| 1|

| 百度| 算法| 72\. 编辑距离|https://leetcode\-cn\.com/problems/edit\-distance/| 1|

| 百度| 算法| 5\. 最长回文子串|https://leetcode\-cn\.com/problems/longest\-palindromic\-substring/| 1|

| 百度| 算法| 206\. 反转链表|https://leetcode\-cn\.com/problems/reverse\-linked\-list/| 1|

| 百度| 算法| 234\. 回文链表|https://leetcode\-cn\.com/problems/palindrome\-linked\-list/| 1|

| 百度| 算法| 剑指 Offer 59\- I\. 滑动窗口的最大值|https://leetcode\-cn\.com/problems/hua\-dong\-chuang\-kou\-de\-zui\-da\-zhi\-lcof/| 1|

| 百度| 算法| 404\. 左叶子之和|https://leetcode\-cn\.com/problems/sum\-of\-left\-leaves/| 1|

| 百度| 算法| 剑指 Offer 21\. 调整数组顺序使奇数位于偶数前面|https://leetcode\-cn\.com/problems/diao\-zheng\-shu\-zu\-shun\-xu\-shi\-qi\-shu\-wei\-yu\-ou\-shu\-qian\-mian\-lcof/| 1|

| 公司| 岗位| 题目| 链接| 频度|

|----|----|-------------------------------|----------------------------------------------------------------------------------------------------------------------|----|

| 百度| 后端| 102\. 二叉树的层序遍历|https://leetcode\-cn\.com/problems/binary\-tree\-level\-order\-traversal/| 4|

| 百度| 后端| 206\. 反转链表|https://leetcode\-cn\.com/problems/reverse\-linked\-list/| 4|

| 百度| 后端| 94\. 二叉树的中序遍历|https://leetcode\-cn\.com/problems/binary\-tree\-inorder\-traversal/| 3|

| 百度| 后端| 199\. 二叉树的右视图|https://leetcode\-cn\.com/problems/binary\-tree\-right\-side\-view/| 3|

| 百度| 后端| 4\. 寻找两个正序数组的中位数|https://leetcode\-cn\.com/problems/median\-of\-two\-sorted\-arrays/| 3|

| 百度| 后端| 142\. 环形链表 II|https://leetcode\-cn\.com/problems/linked\-list\-cycle\-ii/solution/| 3|

| 百度| 后端| 268\. 缺失数字|https://leetcode\-cn\.com/problems/missing\-number/| 2|

| 百度| 后端| 160\. 相交链表|https://leetcode\-cn\.com/problems/intersection\-of\-two\-linked\-lists/| 2|

| 百度| 后端| 62\. 不同路径|https://leetcode\-cn\.com/problems/unique\-paths/| 2|

| 百度| 后端| 146\. LRU缓存机制|https://leetcode\-cn\.com/problems/lru\-cache/| 2|

| 百度| 后端| 349\. 两个数组的交集|https://leetcode\-cn\.com/problems/intersection\-of\-two\-arrays/| 2|

| 百度| 后端| 19\. 删除链表的倒数第N个节点|https://leetcode\-cn\.com/problems/remove\-nth\-node\-from\-end\-of\-list/| 2|

| 百度| 后端| 面试题 01\.06\. 字符串压缩|https://leetcode\-cn\.com/problems/compress\-string\-lcci/| 2|

| 百度| 后端| 104\. 二叉树的最大深度|https://leetcode\-cn\.com/problems/maximum\-depth\-of\-binary\-tree/| 2|

| 百度| 后端| 20\. 有效的括号|https://leetcode\-cn\.com/problems/valid\-parentheses/| 2|

| 百度| 后端| 剑指 Offer 39\. 数组中出现次数超过一半的数字|https://leetcode\-cn\.com/problems/shu\-zu\-zhong\-chu\-xian\-ci\-shu\-chao\-guo\-yi\-ban\-de\-shu\-zi\-lcof/| 2|

| 百度| 后端| 69\. x 的平方根|https://leetcode\-cn\.com/problems/sqrtx/| 2|

| 百度| 后端| 449\. 序列化和反序列化二叉搜索树|https://leetcode\-cn\.com/problems/serialize\-and\-deserialize\-bst/| 1|

| 百度| 后端| 105\. 从前序与中序遍历序列构造二叉树|https://leetcode\-cn\.com/problems/construct\-binary\-tree\-from\-preorder\-and\-inorder\-traversal/| 1|

| 百度| 后端| 215\. 数组中的第K个最大元素|https://leetcode\-cn\.com/problems/kth\-largest\-element\-in\-an\-array/| 1|

| 百度| 后端| 191\. 位1的个数|https://leetcode\-cn\.com/problems/number\-of\-1\-bits/| 1|

| 百度| 后端| 43\. 字符串相乘|https://leetcode\-cn\.com/problems/multiply\-strings/| 1|

| 百度| 后端| 88\. 合并两个有序数组|https://leetcode\-cn\.com/problems/merge\-sorted\-array/| 1|

| 百度| 后端| 3\. 无重复字符的最长子串|https://leetcode\-cn\.com/problems/longest\-substring\-without\-repeating\-characters/| 1|

| 百度| 后端| 121\. 买卖股票的最佳时机|https://leetcode\-cn\.com/problems/best\-time\-to\-buy\-and\-sell\-stock/| 1|

| 百度| 后端| 123\. 买卖股票的最佳时机 III|https://leetcode\-cn\.com/problems/best\-time\-to\-buy\-and\-sell\-stock\-iii/| 1|

| 百度| 后端| 93\. 复原IP地址|https://leetcode\-cn\.com/problems/restore\-ip\-addresses/| 1|

| 百度| 后端| 236\. 二叉树的最近公共祖先|https://leetcode\-cn\.com/problems/lowest\-common\-ancestor\-of\-a\-binary\-tree/| 1|

| 百度| 后端| 110\. 平衡二叉树|https://leetcode\-cn\.com/problems/balanced\-binary\-tree/| 1|

| 百度| 后端| 剑指 Offer 10\- II\. 青蛙跳台阶问题|https://leetcode\-cn\.com/problems/qing\-wa\-tiao\-tai\-jie\-wen\-ti\-lcof/| 1|

| 百度| 后端| 55\. 跳跃游戏|https://leetcode\-cn\.com/problems/jump\-game/| 1|

| 百度| 后端| 剑指 Offer 48\. 最长不含重复字符的子字符串|https://leetcode\-cn\.com/problems/zui\-chang\-bu\-han\-zhong\-fu\-zi\-fu\-de\-zi\-zi\-fu\-chuan\-lcof/| 1|

| 百度| 后端| 15\. 三数之和|https://leetcode\-cn\.com/problems/3sum/| 1|

| 百度| 后端| 剑指 Offer 42\. 连续子数组的最大和|https://leetcode\-cn\.com/problems/lian\-xu\-zi\-shu\-zu\-de\-zui\-da\-he\-lcof/| 1|

| 百度| 后端| 217\. 存在重复元素|https://leetcode\-cn\.com/problems/contains\-duplicate/| 1|

| 百度| 后端| 5\. 最长回文子串|https://leetcode\-cn\.com/problems/longest\-palindromic\-substring/| 1|

| 百度| 后端| 468\. 验证IP地址|https://leetcode\-cn\.com/problems/validate\-ip\-address/| 1|

| 百度| 后端| 46\. 全排列|https://leetcode\-cn\.com/problems/permutations/| 1|

| 百度| 后端| 222\. 完全二叉树的节点个数|https://leetcode\-cn\.com/problems/count\-complete\-tree\-nodes/| 1|

| 百度| 后端| 1143\. 最长公共子序列|https://leetcode\-cn\.com/problems/longest\-common\-subsequence/| 1|

| 百度| 后端| 72\. 编辑距离|https://leetcode\-cn\.com/problems/edit\-distance/| 1|

| 百度| 后端| 剑指 Offer 52\. 两个链表的第一个公共节点|https://leetcode\-cn\.com/problems/liang\-ge\-lian\-biao\-de\-di\-yi\-ge\-gong\-gong\-jie\-dian\-lcof/| 1|

| 百度| 后端| 209\. 长度最小的子数组|https://leetcode\-cn\.com/problems/minimum\-size\-subarray\-sum/| 1|

| 百度| 后端| 151\. 翻转字符串里的单词|https://leetcode\-cn\.com/problems/reverse\-words\-in\-a\-string/| 1|

| 百度| 后端| 9\. 回文数|https://leetcode\.com/problems/palindrome\-number/| 1|

| 百度| 后端| 25\. K 个一组翻转链表|https://leetcode\-cn\.com/problems/reverse\-nodes\-in\-k\-group/| 1|

| 百度| 后端| 面试题 16\.01\. 交换数字|https://leetcode\-cn\.com/problems/swap\-numbers\-lcci/| 1|

| 百度| 后端| 剑指 Offer 04\. 二维数组中的查找|https://leetcode\-cn\.com/problems/er\-wei\-shu\-zu\-zhong\-de\-cha\-zhao\-lcof/| 1|

| 百度| 后端| 剑指 Offer 36\. 二叉搜索树与双向链表|https://leetcode\-cn\.com/problems/er\-cha\-sou\-suo\-shu\-yu\-shuang\-xiang\-lian\-biao\-lcof/| 1|

| 百度| 后端| 剑指 Offer 21\. 调整数组顺序使奇数位于偶数前面|https://leetcode\-cn\.com/problems/diao\-zheng\-shu\-zu\-shun\-xu\-shi\-qi\-shu\-wei\-yu\-ou\-shu\-qian\-mian\-lcof/| 1|

| 百度| 后端| 141\. 环形链表|https://leetcode\-cn\.com/problems/linked\-list\-cycle/| 1|

| 百度| 后端| 168\. Excel表列名称|https://leetcode\-cn\.com/problems/excel\-sheet\-column\-title/| 1|

| 百度| 后端| 148\. 排序链表|https://leetcode\-cn\.com/problems/sort\-list/| 1|

| 百度| 后端| 287\. 寻找重复数|https://leetcode\-cn\.com/problems/find\-the\-duplicate\-number/| 1|

| 百度| 后端| 1095\. 山脉数组中查找目标值|https://leetcode\-cn\.com/problems/find\-in\-mountain\-array/| 1|

| 公司| 岗位| 题目| 地址| 频率|

|----|-----|------------------------|--------------------------------------------------------------------------------|----|

| 百度| 客户端| 206\. 反转链表|https://leetcode\-cn\.com/problems/reverse\-linked\-list/| 2|

| 百度| 客户端| 剑指 Offer 13\. 机器人的运动范围|https://leetcode\-cn\.com/problems/ji\-qi\-ren\-de\-yun\-dong\-fan\-wei\-lcof/| 1|

| 百度| 客户端| 142\. 环形链表 II|https://leetcode\-cn\.com/problems/linked\-list\-cycle\-ii/| 1|

| 百度| 客户端| 144\. 二叉树的前序遍历|https://leetcode\-cn\.com/problems/binary\-tree\-preorder\-traversal/| 1|

| 百度| 客户端| 70\. 爬楼梯|https://leetcode\-cn\.com/problems/climbing\-stairs/| 1|

| 百度| 客户端| 104\. 二叉树的最大深度|https://leetcode\-cn\.com/problems/maximum\-depth\-of\-binary\-tree/| 1|