leetcode/lcof
Rushan f1b58d02dc
docs: update lcof problem: No.046 (#3795)
2024-11-21 11:23:52 +08:00
..
面试题03. 数组中重复的数字
面试题04. 二维数组中的查找
面试题05. 替换空格
面试题06. 从尾到头打印链表
面试题07. 重建二叉树 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题09. 用两个栈实现队列
面试题10- I. 斐波那契数列 feat: add swift implementation to lcof problem: No.10.1 (#2856) 2024-05-20 16:06:32 +08:00
面试题10- II. 青蛙跳台阶问题
面试题11. 旋转数组的最小数字 docs: fix solution to lcof problem: No.11 (#3730) 2024-11-08 08:35:47 +08:00
面试题12. 矩阵中的路径 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题13. 机器人的运动范围
面试题14- I. 剪绳子 feat: add solutions to lc problem: No.0343 (#3291) 2024-07-20 09:30:10 +08:00
面试题14- II. 剪绳子 II
面试题15. 二进制中1的个数
面试题16. 数值的整数次方
面试题17. 打印从1到最大的n位数
面试题18. 删除链表的节点
面试题19. 正则表达式匹配
面试题20. 表示数值的字符串 fix: update solution to lcof problem: No.20 (#3776) 2024-11-19 08:58:11 +08:00
面试题21. 调整数组顺序使奇数位于偶数前面
面试题22. 链表中倒数第k个节点
面试题24. 反转链表
面试题25. 合并两个排序的链表 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题26. 树的子结构 fix: update solution to lcof problem: No.26 (#3757) 2024-11-13 09:09:53 +08:00
面试题27. 二叉树的镜像 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题28. 对称的二叉树
面试题29. 顺时针打印矩阵 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题30. 包含min函数的栈 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题31. 栈的压入、弹出序列
面试题32 - I. 从上到下打印二叉树 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题32 - II. 从上到下打印二叉树 II chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题32 - III. 从上到下打印二叉树 III chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题33. 二叉搜索树的后序遍历序列 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题34. 二叉树中和为某一值的路径 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题35. 复杂链表的复制
面试题36. 二叉搜索树与双向链表
面试题37. 序列化二叉树
面试题38. 字符串的排列
面试题39. 数组中出现次数超过一半的数字
面试题40. 最小的k个数
面试题41. 数据流中的中位数 chore: update lc problems (#3314) 2024-07-24 08:47:50 +08:00
面试题42. 连续子数组的最大和
面试题43. 1~n整数中1出现的次数
面试题44. 数字序列中某一位的数字 docs: update lcof problem: No.044 (#3777) 2024-11-19 08:58:38 +08:00
面试题45. 把数组排成最小的数 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题46. 把数字翻译成字符串 docs: update lcof problem: No.046 (#3795) 2024-11-21 11:23:52 +08:00
面试题47. 礼物的最大价值
面试题48. 最长不含重复字符的子字符串
面试题49. 丑数
面试题50. 第一个只出现一次的字符
面试题51. 数组中的逆序对
面试题52. 两个链表的第一个公共节点
面试题53 - I. 在排序数组中查找数字 I
面试题53 - II. 0~n-1中缺失的数字
面试题54. 二叉搜索树的第k大节点 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题55 - I. 二叉树的深度 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题55 - II. 平衡二叉树 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题56 - I. 数组中数字出现的次数
面试题56 - II. 数组中数字出现的次数 II
面试题57 - II. 和为s的连续正数序列
面试题57. 和为s的两个数字
面试题58 - I. 翻转单词顺序
面试题58 - II. 左旋转字符串
面试题59 - I. 滑动窗口的最大值
面试题59 - II. 队列的最大值
面试题60. n个骰子的点数
面试题61. 扑克牌中的顺子
面试题62. 圆圈中最后剩下的数字
面试题63. 股票的最大利润
面试题64. 求1+2+…+n chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题65. 不用加减乘除做加法
面试题66. 构建乘积数组
面试题67. 把字符串转换成整数 feat: add cpp solution to lcof problem: No.67 (#3790) 2024-11-19 19:17:12 +08:00
面试题68 - I. 二叉搜索树的最近公共祖先 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
面试题68 - II. 二叉树的最近公共祖先 chore: format rust code with rustfmt (#3140) 2024-06-21 11:30:25 +08:00
README.md
README_EN.md
lcof.json
lcof.png
lcof_list.json

README_EN.md

comments edit_url
true https://github.com/doocs/leetcode/edit/main/lcof/README_EN.md

Coding Interviews, 2nd Edition

This book is about coding interview questions from software and Internet companies. It covers five key factors which determine performance of candidates: (1) the basics of programming languages, data structures and algorithms, (2) approaches to writing code with high quality, (3) tips to solve difficult problems, (4) methods to optimize code, (5) soft skills required in interviews. The basics of languages, algorithms and data structures are discussed as well as questions that explore how to write robust solutions after breaking down problems into manageable pieces. It also includes examples to focus on modeling and creative problem solving.

Interview questions from the most popular companies in the IT industry are taken as examples to illustrate the five factors above. Besides solutions, it contains detailed analysis, how interviewers evaluate solutions, as well as why they like or dislike them. The author makes clever use of the fact that interviewees will have limited time to program meaningful solutions which in turn, limits the options an interviewer has. So the author covers those bases.

Readers will improve their interview performance after reading this book. It will be beneficial for them even after they get offers, because its topics, such as approaches to analyzing difficult problems, writing robust code and optimizing, are all essential for high-performing coders.

中文文档

Solutions

English Solutions is not available for the book. Please switch to Chinese version.

Press Control + F(or Command + F on the Mac) to search anything you want.

The copyright of this project belongs to Doocs community. For commercial reprints, please contact @yanglbme for authorization. For non-commercial reprints, please indicate the source.

Contact Us

We welcome everyone to add @yanglbme's personal WeChat (WeChat ID: YLB0109), with the note "leetcode". In the future, we will create algorithm and technology related discussion groups, where we can learn and share experiences together, and make progress together.

License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.