本网页记录了本人刷LeetCode的题解和一些个人心得。
LeetCode里面没有简单题。要重视每一道题，包括easy难度，都有技巧，都有坑。
LeetCode按标签出现频率
https://www.nowcoder.com/discuss/295269?type=0&order=0&pos=6&page=1
LeetCode 频率排序截图
https://blog.csdn.net/johnsoncheng/article/details/89111800
面试高频出现的 LeetCode 算法题集（重中之重）
https://blog.csdn.net/weixin_38118016/article/details/90761111
「面试必问」leetcode高频题精选
https://juejin.im/post/6844904183007543310#heading-67
Facebook Group - LeetCode Problem Solve
https://www.facebook.com/groups/1457343921235182
Facebook Channel #CodingInterviews
https://www.facebook.com/hashtag/codinginterviews
牛客网-字节跳动
https://www.nowcoder.com/discuss/tag/665
用Python解答LeetCode的repo
https://github.com/maemual/solution4leetcode
LeetCode被各大公司面到的高频试题
https://github.com/yuan-luo/LeetcodeTop
一亩三分地高频题 上岸回馈
https://www.1point3acres.com/bbs/thread-690957-1-1.html
- binary tree 搜索：
i. DFS: preorder, inorder, postorder; iteration/recursion https://shawnlyu.com/algorithms/tree-traversal-recursively-iteratively-preorder-inorder-postorder/
ii. BFS: https://shawnlyu.com/algorithms/intro-to-graph-algorithms-bfs-dfs/
iii. Backtracking: https://shawnlyu.com/algorithms/leetcode-for-interviewdfs-bfs-and-backtracking-ii-how-to-backtrack-detailed-explanations-with-examples/ - Sortings: https://shawnlyu.com/algorithms/visualized-python-intro-to-sorting-algorithms-selections-sort-insertion-sort-bucket-sort-bubble-sort-mergesort-quicksort-heapsort-and-their-complexity-analysis/
- Topological sort: https://shawnlyu.com/algorithms/graph-algorithm-topological-sort/
- TopK problem: https://shawnlyu.com/algorithms/top-k-problem-sort-heap-and-quickselect/
- 分治**: https://shawnlyu.com/algorithms/divide-and-conquer-what-is-it-and-how-to-use-it/
- 最短距离Dijkstra: https://shawnlyu.com/algorithms/shortest-path-algorithms-i-dijkstra/
- 判断linkedlist的环 - 龟兔: https://shawnlyu.com/algorithms/floyds-cycle-detection-algorithm-leetcode142-linked-list-cycle-ii/
- Trie: https://shawnlyu.com/algorithms/intro-to-trie-prefix-tree-feat-leetcode-208-implement-trie/
- Disjoint set: https://shawnlyu.com/algorithms/disjoint-set-union-find/
- MST Prim: https://shawnlyu.com/algorithms/minimum-spanning-tree-prim/
- Binary search: https://shawnlyu.com/algorithms/binary-search-find-upper-and-lower-bound/
- BFS & Bi-BFS: https://shawnlyu.com/algorithms/bfs-and-bi-directional-bfs/
Java Garbage Collection: https://shawnlyu.com/tech/java-garbage-collection/ Database Indexing: https://shawnlyu.com/tech/database-index/