求职课程|高频面试题|经验采访|文章分享
✨ 一对一入职套餐,无需定金,入职不成功不收费,详细信息请浏览求职课程 ✨
根据国内外论坛收集超过 2000 篇真实面经,包括腾讯,阿里,字节跳动,Shopee,美团,滴滴,百度,京东等公司的高频面试题。
热门项目 | 链接 |
---|---|
简历例句 | https://github.com/resumejob/awesome-resume |
大厂高频面经面试题 | https://osjobs.net/topk/ |
免费项目实战课程 | https://github.com/resumejob/free-project-course/ |
-
Pre Sum (hash map)
-
Calculation
-
Monotonous Stack
-
Decode Stack / DFS
-
Sort First
-
Matrix Loop
-
Trie Tree
-
Data Structure Design
-
Hash map compare
-
Palindromic Substring
-
Merge Sort
-
Merge Combine Sort
-
Two Pointer Slide window
- 3. Longest Substring Without Repeating Characters
- 76. Minimum Window Substring
- 159. Longest Substring with At Most Two Distinct Characters
- 209. Minimum Size Subarray Sum
- 340. Longest Substring with At Most K Distinct Characters
- 438. Find All Anagrams in a String
- 567. Permutation in String
- 727. Minimum Window Subsequence
-
Two Pointer
-
Heap (K elements)
-
Multiple Heap
-
Basic DFS
-
DFS Hard
-
Basic BFS
-
Topological Sort
-
Basic Binary Search
-
Binary Search Hard
-
DP Stock
-
Basic DP
- 10. Regular Expression Matching
- 36. Valid Sudoku
- 44. Wildcard Matching
- 45. Jump Game II
- 62. Unique Paths
- 70. Climbing Stairs
- 91. Decode Ways
- 96. Unique Binary Search Trees
- 97. Interleaving String
- 128. Longest Consecutive Sequence
- 152. Maximum Product Subarray
- 139. Word Break
- 198. House Robber
- 221. Maximal Square
- 256. Paint House
- 300. Longest Increasing Subsequence
-
Swap Trick
-
Random
-
Stack Basic
-
Bruce Force
-
Serialize and Deserialize
-
Tree Recursion
-
Tree Non Recursion
-
Validate Tree
-
Construct or recover Tree
-
Clone