base on 🌍 针对小白的算法训练 | 包括四部分：①.大厂面经 ②.力扣图解 ③.千本开源电子书 ④.百张技术思维导图（项目花了上百小时，希望可以点 star 支持，🌹感谢~）推荐免费ChatGPT使用网站 ## 简介 English version repo and Gitbook is on [english branch](https://github.com/geekxh/hello-algorithm/tree/english) > ### **小浩算法是一套针对小白的完整的算法训练流程！** > > <a href="https://www.geekxh.com/"><img src="https://www.geekxh.com/svg/0-1-blueviolet.svg" alt="css"></a> > <a href="https://github.com/haizlin/fe-interview/stargazers"><img src="https://img.shields.io/github/stars/geekxh/hello-algorithm.svg" alt="Statr"></a> > <a href="https://github.com/haizlin/fe-interview/stargazers"><img src="https://www.geekxh.com/svg/2-1-success.svg" alt="Statr"></a> > > 目前共包括以下几个步骤： > - PART_1_算法基础 > - PART_2_力扣图解 > - PART_3_大厂面试 > - PART_4_CS知识汇总 > > [目前已支持 PDF 下载](https://www.cxyhub.com/all/programming/7786/) <div align="center"> <a href="https://www.geekxh.com"><img src="https://www.geekxh.com/logo_tmp.png" width="350px"></a> </div> <p align="center"> <a href="https://www.geekxh.com/"><img src="https://www.geekxh.com/svg/0-1-blueviolet.svg" alt="css"></a> <a href="https://github.com/haizlin/fe-interview/stargazers"><img src="https://img.shields.io/github/stars/geekxh/hello-algorithm.svg" alt="Statr"></a> <a href="https://github.com/haizlin/fe-interview/stargazers"><img src="https://www.geekxh.com/svg/2-1-success.svg" alt="Statr"></a> </p> <p align="center"> <b>这也许是东半球最好的算法学习类项目！</b> </p> </br> > 我自己刷题都是在 lintcode 进行，也会在上面更新题解！下方可以直接进入~ - [www.lintcode.com](https://www.lintcode.com/?utm_source=tf-github-xh2022) - [另外推荐一套算法课，北大FB双料大佬的，我之前上过，性价比很高](https://www.jiuzhang.com/course/71/?utm_source=tf-github-xh2022) - 最后，下方扫码可以领取我准备的刷题模板 <p align="center"> <img height="200" src="https://www.cxyhub.com/wp-content/uploads/2022/08/f9e51121533b2c175bcb41ee8c05e62.jpg"> </p> ### 正文 ### PART_1_算法基础 主要包括两部分： - a：数据结构知识框架：为了大家更好的掌握数据结构和算法，我把基础知识整理成了一张思维导图，包括下面这些知识点： > [开始学习](PART_1_算法基础/README.md) - b：对常用的数据结构知识进行总结： * [链表](PART_1_算法基础/2_基础知识/linked-list/README.md) * [双向链表](PART_1_算法基础/2_基础知识/doubly-linked-list/README.md) * [队列](PART_1_算法基础/2_基础知识/queue/README.md) * [栈](PART_1_算法基础/2_基础知识/stack/README.md) * [哈希表(散列)](PART_1_算法基础/2_基础知识/hash-table/README.md) * [堆](PART_1_算法基础/2_基础知识/heap/README.md) * [优先队列](PART_1_算法基础/2_基础知识/priority-queue/README.md) * [字典树](PART_1_算法基础/2_基础知识/trie/README.md) * [树](PART_1_算法基础/2_基础知识/tree/README.md) * [图](PART_1_算法基础/2_基础知识/graph/README.md) ### PART_2_力扣图解 <details><summary><a>显示更多</a></summary></br> > [小浩图解算法题典.PDF【完整版】下载](https://www.cxyhub.com/all/programming/7786/) - [开始学习](http://www.geekxh.com) - [阅读指南](http://www.geekxh.com/c99/hello.html) - 数组 - [01.最长公共前缀(14)](http://www.geekxh.com/1.0.数组系列/002.html) - [02.买卖股票的最佳时机(122)](http://www.geekxh.com/1.0.数组系列/003.html) - [03.旋转数组(189)](http://www.geekxh.com/1.0.数组系列/004.html) - [04.原地删除(27)](http://www.geekxh.com/1.0.数组系列/005.html) - [05.加一(66)](http://www.geekxh.com/1.0.数组系列/006.html) - [06.两数之和(1)](http://www.geekxh.com/1.0.数组系列/007.html) - [07.三数之和(15)](http://www.geekxh.com/1.0.数组系列/008.html) - [08.Z字形变换(6)](http://www.geekxh.com/1.0.数组系列/009.html) - 链表 - [01.删除链表倒数第N个节点(19)](http://www.geekxh.com/1.1.链表系列/101.html) - [02.合并两个有序链表(21)](http://www.geekxh.com/1.1.链表系列/102.html) - [03.环形链表(141)](http://www.geekxh.com/1.1.链表系列/103.html) - [04.两数相加(2)](http://www.geekxh.com/1.1.链表系列/104.html) - 动态规划 - [01.爬楼梯(70)](http://www.geekxh.com/1.2.动态规划系列/201.html) - [02.最大子序和(53)](http://www.geekxh.com/1.2.动态规划系列/202.html) - [03.最长上升子序列(300)](http://www.geekxh.com/1.2.动态规划系列/203.html) - [04.三角形最小路径和(120)](http://www.geekxh.com/1.2.动态规划系列/204.html) - [05.最小路径和(64)](http://www.geekxh.com/1.2.动态规划系列/205.html) - [06.打家劫舍(198)](http://www.geekxh.com/1.2.动态规划系列/206.html) - 字符串 - [01.反转字符串(344)](http://www.geekxh.com/1.3.字符串系列/301.html) - [02.字符串中的第一个唯一字符(387)](http://www.geekxh.com/1.3.字符串系列/302.html) - [03.实现 Sunday 匹配](http://www.geekxh.com/1.3.字符串系列/303.html) - [04.大数打印](http://www.geekxh.com/1.3.字符串系列/304.html) - [05.验证回文串(125)](http://www.geekxh.com/1.3.字符串系列/305.html) - [06.KMP 精讲](http://www.geekxh.com/1.3.字符串系列/306.html) - [07.旋转字符串(796)](http://www.geekxh.com/1.3.字符串系列/307.html) - [08.最后一个单词的长度(58)](http://www.geekxh.com/1.3.字符串系列/308.html) - 二叉树 - [01.最大深度与DFS(104)](http://www.geekxh.com/1.4.二叉树系列/401.html) - [02.层次遍历与BFS(102)](http://www.geekxh.com/1.4.二叉树系列/402.html) - [03.BST与其验证(98)](http://www.geekxh.com/1.4.二叉树系列/403.html) - [04.BST 的查找(700)](http://www.geekxh.com/1.4.二叉树系列/404.html) - [05.BST 的删除(450)](http://www.geekxh.com/1.4.二叉树系列/405.html) - [06.平衡二叉树(110)](http://www.geekxh.com/1.4.二叉树系列/406.html) - [07.完全二叉树(222)](http://www.geekxh.com/1.4.二叉树系列/407.html) - [08.二叉树的剪枝(814)](http://www.geekxh.com/1.4.二叉树系列/408.html) - 滑动窗口 - [01.滑动窗口最大值（239）](http://www.geekxh.com/1.5.滑动窗口系列/501.html) - [02.无重复字符的最长子串（3）](http://www.geekxh.com/1.5.滑动窗口系列/502.html) - [03.找到字符串中所有字母异位词（438）](http://www.geekxh.com/1.5.滑动窗口系列/503.html) - [04.和为s的连续正数序列](http://www.geekxh.com/1.5.滑动窗口系列/504.html) - 博弈论 - [01.囚徒困境](http://www.geekxh.com/1.6.博弈论系列/601.html) - [02.辛普森悖论](http://www.geekxh.com/1.6.博弈论系列/602.html) - [03.红眼睛和蓝眼睛](http://www.geekxh.com/1.6.博弈论系列/603.html) - [04.海盗分金币](http://www.geekxh.com/1.6.博弈论系列/604.html) - [05.智猪博弈](http://www.geekxh.com/1.6.博弈论系列/605.html) - [06.生男生女的问题](http://www.geekxh.com/1.6.博弈论系列/606.html) - [07.硬币问题](http://www.geekxh.com/1.6.博弈论系列/607.html) - [08.画圈圈的问题](http://www.geekxh.com/1.6.博弈论系列/608.html) - [09.巧克力问题](http://www.geekxh.com/1.6.博弈论系列/609.html) - [10.大鱼和小鱼的问题](http://www.geekxh.com/1.6.博弈论系列/610.html) - 位运算 - [01.使用位运算求和](http://www.geekxh.com/1.8.位运算系列/801.html) - [02.2的幂(231)](http://www.geekxh.com/1.8.位运算系列/802.html) - [03.返回一个数二进制中1的个数](http://www.geekxh.com/1.8.位运算系列/803.html) - [04.只出现一次的数字](http://www.geekxh.com/1.8.位运算系列/804.html) - [05.只出现一次的数字Ⅱ](http://www.geekxh.com/1.8.位运算系列/805.html) - [06.缺失数字(268)](http://www.geekxh.com/1.8.位运算系列/806.html) - 二分法 - [01.爱吃香蕉的珂珂（875）](http://www.geekxh.com/1.9.二分法系列/901.html) - [02.x的平方根（69）](http://www.geekxh.com/1.9.二分法系列/902.html) - [03.x的平方根（69）](http://www.geekxh.com/1.9.二分法系列/903.html) - [04.旋转排序数组中的最小值Ⅰ（153）](http://www.geekxh.com/1.9.二分法系列/904.html) - [05.旋转排序数组中的最小值Ⅱ(154)](http://www.geekxh.com/1.9.二分法系列/905.html) - [06.供暖器（475）](http://www.geekxh.com/1.9.二分法系列/906.html) - 其他高频面试题目 - [01.螺旋矩阵(54)](http://www.geekxh.com/1.99.其他补充题目/01.html) - [02.只有两个键的键盘(650)](http://www.geekxh.com/1.99.其他补充题目/02.html) - [03.24点游戏(679)](http://www.geekxh.com/1.99.其他补充题目/03.html) - [04.飞机座位分配概率(1227)](http://www.geekxh.com/1.99.其他补充题目/04.html) - [05.水分子的产生](http://www.geekxh.com/1.99.其他补充题目/05.html) - [06.救生艇(881)](http://www.geekxh.com/1.99.其他补充题目/06.html) - [07.救生艇(881)](http://www.geekxh.com/1.99.其他补充题目/07.html) - [08.灯泡开关(319)](http://www.geekxh.com/1.99.其他补充题目/08.html) - [09.三门问题](http://www.geekxh.com/1.99.其他补充题目/09.html) - [10.猜数字游戏(299)](http://www.geekxh.com/1.99.其他补充题目/10.html) - [11.LRU缓存机制(146)](http://www.geekxh.com/1.99.其他补充题目/11.html) - [12.最小的k个数](http://www.geekxh.com/1.99.其他补充题目/12.html) - [13.不同路径](http://www.geekxh.com/1.99.其他补充题目/13.html) - [14.不同路径-障碍物](http://www.geekxh.com/1.99.其他补充题目/14.html) - [15.连续n个数的和](http://www.geekxh.com/1.99.其他补充题目/15.html) - [16.盛水最多的容器](http://www.geekxh.com/1.99.其他补充题目/16.html) - [17.扑克牌中的顺子容器](http://www.geekxh.com/1.99.其他补充题目/17.html) - [18.整数拆分(343)](http://www.geekxh.com/1.99.其他补充题目/18.html) - [19.移动石子到连续(1033)](http://www.geekxh.com/1.99.其他补充题目/19.html) - [20.Nim游戏(292)](http://www.geekxh.com/1.99.其他补充题目/20.html) - [21.寻找两个正序数组的中位数(4)](http://www.geekxh.com/1.99.其他补充题目/21.html) - [22.第k个最大元素（215）](http://www.geekxh.com/1.99.其他补充题目/22.html) - [23.镜面反射（858）](http://www.geekxh.com/1.99.其他补充题目/23.html) - [25.整数转罗马数字（12）](http://www.geekxh.com/1.99.其他补充题目/25.html) - [26.荷兰国旗问题](http://www.geekxh.com/1.99.其他补充题目/26.html) - [27.六九问题](http://www.geekxh.com/1.99.其他补充题目/27.html) - [28.有效的数独](http://www.geekxh.com/1.99.其他补充题目/28.html) - [29.费米估算](http://www.geekxh.com/1.99.其他补充题目/29.html) - [30.分发饼干](http://www.geekxh.com/1.99.其他补充题目/30.html) - [31.生命游戏（289）](http://www.geekxh.com/1.99.其他补充题目/31.html) - [32.搜索二维矩阵（74）](http://www.geekxh.com/1.99.其他补充题目/32.html) - [33.子集（78）](http://www.geekxh.com/1.99.其他补充题目/33.html) - [34.面试中的智力题](http://www.geekxh.com/1.99.其他补充题目/34.html) - [35.旋转图像（48）](http://www.geekxh.com/1.99.其他补充题目/51.html) </details> ### PART_3_大厂面试（更新中） <details><summary><a>显示更多</a></summary></br> 考虑到现在网上面经实在太杂，很多都冠以 “BAT” 之名，重复率、错误率都非常高。所以我尽可能的挑选出了我认为比较好的 50 篇面经（基本不重复），并对内容做了分类。 建议大家把这个页面收藏起来，防止后面需要的时候找不到了。（整理了近40个小时，跪求star~） - [系统设计-长文（非常建议读，我自己也看了）](https://github.com/donnemartin/system-design-primer/blob/master/README-zh-Hans.md) - [后端-社招(两年): 蚂蚁 头条 PingCAP](https://github.com/aylei/interview) - [后端-京东-JAVA](https://www.cnblogs.com/wupeixuan/p/8908524.html#%E4%B8%80%E3%80%81java) - [后端-百度-高并发抢红包设计](https://github.com/xbox1994/Java-Interview/blob/master/MD/%E7%B3%BB%E7%BB%9F%E8%AE%BE%E8%AE%A1-%E9%AB%98%E5%B9%B6%E5%8F%91%E6%8A%A2%E7%BA%A2%E5%8C%85.md) - [NLP（机器学习）-百度](https://www.e-learn.cn/topic/95743) </details> ### PART_4_CS_知识汇总(TODO) ### License 本项目除部分引用开源技术文档的内容外，大部分为本人原创。欢迎任何以学习为目的的传播，但未授权任何平台进行转载！ ", Assign "at most 3 tags" to the expected json: {"id":"2184","tags":[]} "only from the tags list I provide: [{"id":77,"name":"3d"},{"id":89,"name":"agent"},{"id":17,"name":"ai"},{"id":54,"name":"algorithm"},{"id":24,"name":"api"},{"id":44,"name":"authentication"},{"id":3,"name":"aws"},{"id":27,"name":"backend"},{"id":60,"name":"benchmark"},{"id":72,"name":"best-practices"},{"id":39,"name":"bitcoin"},{"id":37,"name":"blockchain"},{"id":1,"name":"blog"},{"id":45,"name":"bundler"},{"id":58,"name":"cache"},{"id":21,"name":"chat"},{"id":49,"name":"cicd"},{"id":4,"name":"cli"},{"id":64,"name":"cloud-native"},{"id":48,"name":"cms"},{"id":61,"name":"compiler"},{"id":68,"name":"containerization"},{"id":92,"name":"crm"},{"id":34,"name":"data"},{"id":47,"name":"database"},{"id":8,"name":"declarative-gui "},{"id":9,"name":"deploy-tool"},{"id":53,"name":"desktop-app"},{"id":6,"name":"dev-exp-lib"},{"id":59,"name":"dev-tool"},{"id":13,"name":"ecommerce"},{"id":26,"name":"editor"},{"id":66,"name":"emulator"},{"id":62,"name":"filesystem"},{"id":80,"name":"finance"},{"id":15,"name":"firmware"},{"id":73,"name":"for-fun"},{"id":2,"name":"framework"},{"id":11,"name":"frontend"},{"id":22,"name":"game"},{"id":81,"name":"game-engine "},{"id":23,"name":"graphql"},{"id":84,"name":"gui"},{"id":91,"name":"http"},{"id":5,"name":"http-client"},{"id":51,"name":"iac"},{"id":30,"name":"ide"},{"id":78,"name":"iot"},{"id":40,"name":"json"},{"id":83,"name":"julian"},{"id":38,"name":"k8s"},{"id":31,"name":"language"},{"id":10,"name":"learning-resource"},{"id":33,"name":"lib"},{"id":41,"name":"linter"},{"id":28,"name":"lms"},{"id":16,"name":"logging"},{"id":76,"name":"low-code"},{"id":90,"name":"message-queue"},{"id":42,"name":"mobile-app"},{"id":18,"name":"monitoring"},{"id":36,"name":"networking"},{"id":7,"name":"node-version"},{"id":55,"name":"nosql"},{"id":57,"name":"observability"},{"id":46,"name":"orm"},{"id":52,"name":"os"},{"id":14,"name":"parser"},{"id":74,"name":"react"},{"id":82,"name":"real-time"},{"id":56,"name":"robot"},{"id":65,"name":"runtime"},{"id":32,"name":"sdk"},{"id":71,"name":"search"},{"id":63,"name":"secrets"},{"id":25,"name":"security"},{"id":85,"name":"server"},{"id":86,"name":"serverless"},{"id":70,"name":"storage"},{"id":75,"name":"system-design"},{"id":79,"name":"terminal"},{"id":29,"name":"testing"},{"id":12,"name":"ui"},{"id":50,"name":"ux"},{"id":88,"name":"video"},{"id":20,"name":"web-app"},{"id":35,"name":"web-server"},{"id":43,"name":"webassembly"},{"id":69,"name":"workflow"},{"id":87,"name":"yaml"}]" returns me the "expected json"