当前位置:网站首页>Leetcode notes of Google boss | necessary for school recruitment!

Leetcode notes of Google boss | necessary for school recruitment!

2022-06-24 16:14:00 Sharing programmers

Hello everyone , Today, I'd like to introduce a Github over ten thousand star Notes to brush questions , After watching , Direct second kill most medium difficulty Leetcode subject

The author is a Google engineer .

Gao Chang is now Google's unmanned car division (Waymo) The engineer , Engaged in computer vision and machine learning . When he was studying for a master's degree at Carnegie Mellon University , In order to prepare for the internship , He began to tidy up... In the summer code Topics on , A few months , Hundreds of questions were painted . Into the pre-service , In my spare time , It occurred to him that , I've done so many questions myself , And the solution to many problems has been summarized , Why not sum up these topics , Make an e-book that is easy for later comers to read and learn ? With ideas , As an activist, he does what he says , So such a beautifully produced and free open source book appeared in front of you .

To quote him :

This book is divided into two parts: algorithm and data structure , It's subdivided into 15 chapters , Detailed explanation of the common skills when brush questions . I reduced the title to 101 Avenue , First, it echoes the title of this book , Second, we don't want readers to read and Practice for too long . The bad thing about this is that , If you just practice this 101 Problem . So at the end of each chapter , I added some recommended exercises , Some solutions are given , I hope the readers can finish the exercises after understanding each chapter .

The whole book , I took a close look at , And some of the book to solve the problem ideas and code for verification . In terms of my intuitive feelings , This is a heart of the data structure algorithm books , The whole book is 143 Page length , There are 15 chapters to explain the algorithm in detail . Each chapter is an important knowledge point , Accompanied by basic explanation and example introduction , Of course , There are also some recommended exercises . Don't talk much , Let's take a look at the contents of the books :

image.png

The second chapter is about greedy algorithm , Let's take a few excerpts to see , It is found that the explanation and introduction of knowledge points are meticulous .

image.png

For the convenience of the reader , I have downloaded and uploaded the open source e-book to Baidu cloud disk :

link : https://pan.baidu.com/s/1nghTi7EBWF2hfufox3ZbTw

Extraction code : gdnu

Feel useful , One button three times ~

原网站

版权声明
本文为[Sharing programmers]所创,转载请带上原文链接,感谢
https://yzsam.com/2021/05/20210504003613527M.html