【干货】程序员面试一定要掌握的10个算法 | LeetCode 刷题清单 | 100小时+刷题经验分享 [上]

Опубликовано: 29 Август 2026
на канале: bianbian边边
53,525
2.8k

❏ ⭐️ Career Coaching ⭐️
最近开始了一个副业 - career coaching!我自己对帮助别人,做职业 mentorship 一直比较擅长和感兴趣。结合我自己的经历,在找工作和职业初期,有很多迷茫的时候,mentor 对我的帮助真的很大。所以我想开始做正式的 career coaching,给大家提供更深入的职业发展建议!

📍形式
每次 1h 私人 1:1,结合你自己的情况,给你对你最有用的建议。

📍Topics
Job search support (review your resume, how to prepare for technical interview, practice interviews including technical interview and behavioral interview, etc.)
Early career coaching
Career development
Professional goals
Looking to pivot to a SDE career
Performance
Women @Tech

📍收费标准 & 预约
ins 私信 bianbian621(可以参考网上正常的 tech career coaching 的价格)


做这个视频 距离我上次刷题已经快两年了
我也是学了就忘那种 所以总结 复习和写文案都花了10个小时以上的时间
而且融合了我上百小时的刷题心血!!

而且我也不是擅长给讲题的那种 所以拍下来真的好累啊
感觉好多东西 我也不知道我有没有说清楚 哈哈哈哈

反正我脑汁已经没了 希望大家一定要点赞订阅!!
祝大家刷题加油 找工作顺利 都能拿到自己心仪的offer!

==================================================
以下是我说的 10 个算法和数据结构 和他们的 Leet Code 经典题!
功课都给你总结好了 还不来抄!

1. Recursion / Backtracking
a. 39. Combination Sum https://leetcode.com/problems/combina...
b. 40. Combination Sum II https://leetcode.com/problems/combina...
c. 78. Subsets https://leetcode.com/problems/subsets/
d. 90. Subsets II https://leetcode.com/problems/subsets...
e. 46. Permutations https://leetcode.com/problems/permuta...
f. 47. Permutations II https://leetcode.com/problems/permuta...

2. Graph Traversal - DFS, BFS, Topological Sorting
a. 133. Clone Graph https://leetcode.com/problems/clone-g... BFS / DFS
b. 127. Word Ladder https://leetcode.com/problems/word-la... BFS
c. 490. The Maze https://leetcode.com/problems/the-maze/
d. 210. Course Schedule II https://leetcode.com/problems/course-... (Topological Sorting)
e. 269. Alien Dictionary https://leetcode.com/problems/alien-d... (Topological Sorting)

3. Binary Tree / Binary Search Tree (BST)
a. 94. Binary Tree Inorder Traversal https://leetcode.com/problems/binary-...
b. 236. Lowest Common Ancestor of a Binary Tree https://leetcode.com/problems/lowest-...
c. 297. Serialize and Deserialize Binary Tree https://leetcode.com/problems/seriali...
d. 98. Validate Binary Search Tree https://leetcode.com/problems/validat...
e. 102. Binary Tree Level Order Traversal https://leetcode.com/problems/binary-... (BFS)

4. Binary Search
a. 34. Find First and Last Position of Element in Sorted Array https://leetcode.com/problems/find-fi...
b. 162. Find Peak Element https://leetcode.com/problems/find-pe...
c. 69. Sqrt(x) https://leetcode.com/problems/sqrtx/


5. Data Structure
a. 242. Valid Anagram https://leetcode.com/problems/valid-a... (Hash Table)
b. 133. Clone Graph https://leetcode.com/problems/clone-g... (Hash Table)
c. 127. Word Ladder https://leetcode.com/problems/word-la... (Hash Table)
d. 155. Min Stack https://leetcode.com/problems/min-stack/ (Stack)
e. 225. Implement Stack using Queues https://leetcode.com/problems/impleme... (Stack / Queue)
f. 215. Kth Largest Element in an Array https://leetcode.com/problems/kth-lar... (PriorityQueue)
g. 23. Merge k Sorted Lists https://leetcode.com/problems/merge-k... (PriorityQueue)

6. Linked List Manipulation
a. 237. Delete Node in a Linked List https://leetcode.com/problems/delete-...
b. 92. Reverse Linked List II https://leetcode.com/problems/reverse...
c. 876. Middle of the Linked List https://leetcode.com/problems/middle-...
d. 143. Reorder List https://leetcode.com/problems/reorder...

【关注我👻】
Ins: bianbian621
Weibo: 边边_401
B站: bianbian边边
小红书: bianbian边边

【边边 折扣福利】
💜 Lookfantastic 用折扣码【BIAN】 75折
https://tidd.ly/3nz0Pjx
线上7折+叠加95折 (=65折) 折扣码【BIAN5】
https://tidd.ly/3d8uhb8
💜 Adornmonde Jewelry 用折扣码【BIANBIAN10】全场9折
https://bit.ly/348Tobj
💜 Ana Luisa Jewelry 用折扣码【BIANBIAN10】全场9折
https://bit.ly/2xltnYb
💜 Beara Beara 用折扣码【bianbian】全场9折
https://bit.ly/32zib60
💜 Rakuten(原 Ebates) 返利网站注册送 $10 福利
https://bit.ly/33lKXGJ

【music】
  / ericreprid  
ttps://soundcloud.com/quicklyquickly

📷相机: Canon g7x mark ii - http://bit.ly/2ZSxunm
🎥剪辑: Final Cut Pro X

【disclaimer 声明】
This video is not sponsored. 这个视频不是赞助的。
Some of the links are affiliated. 有的链接是返利链接,就是说用这个链接购买的话,会给我一小部分钱(当然你的购买价钱不会改变)。如果你要用这些链接买东西的话,提前感谢你了!❤️🙏

【business inquiries 合作联系邮箱】[email protected]