Gao chang now works as an engineer at Google’s Waymo unit, focusing on computer vision and machine learning. \

When he was studying for a master’s degree at Carnegie Mellon University in the United States, he began to sort out questions on a code in the summer in order to prepare for the fall internship, and he swiped hundreds of questions in a few months.

With a solid foundation and long-term diligence, he soon found the job he wanted.

Before entering the job, in his spare time, he suddenly thought that he had brushed so many questions and summarized the solution of many questions. Why not summarize some of these questions and make it into an e-book for the convenience of later readers?

He had an idea, and as a man of action, he did it, and a beautifully crafted, free and open source book appeared.

To quote him:

The book is divided into algorithms and data structures, and subdivided into 15 chapters, explaining in detail the techniques often used to brush questions. I’ve narrowed it down to 101 topics, both to match the title of the book and to keep readers from spending too much time reading and practicing.

The downside of this is that if you only practice the 101 questions, you may not have a solid grasp of algorithms and data structures. Therefore, AT the end of each chapter, I have added some recommended exercises and given some tips for solving them, hoping that readers will complete the exercises after understanding each chapter.

The whole book, I carefully read again, and some of the book’s solution ideas and code for verification.

From my intuitive feeling, this is a hard data structure algorithm book, a total of 143 pages of length, detailed algorithm content has 15 chapters.

Each chapter contains some important points, along with basic explanations and examples, as well as recommended practice questions.

Without further ado, let’s take a look at the table of contents:

The second chapter is about greedy algorithm, we pick some content to view, found that the knowledge point is detailed introduction.

For the convenience of readers, I have downloaded the open source e-book and uploaded it to Baidu cloud disk.

access

Step 1: Scan code to pay attention to “Childe Dragon” public number

Step 2: Reply to the number 007 to obtain information

· · · · · · · · · · · · · · · · · END · · · · · · · · · · · · · · · · ·