Don’t miss this brush notes! Can absolutely improve your brush efficiency and algorithm ability!
Before last year’s college entrance exam, I was also troubled by the inefficiency of question brushing, until ONE day I found the notes written by the Google engineer.
After reading this paper, I have mastered the “routine” of brushing questions. I have brushed more than 200 questions directly, and the questions in the interview are basically no problem.
When the author is looking for a job, he has typed hundreds of questions in Leetcode and sorted them into categories.
He says the book is aimed at code farmers looking for work in North America or In China, or newcomers to THE ACM Algorithm contest.
After reading the common data structures and algorithms explained in this book, you won’t be stuck on medium difficulty problems in Leetcode.
This book contains the answers to all questions in LeetCode Online Judge. All code implementations are available in both CPP and Java versions:
All the codes can be found in Gitbub, and the code is well standardized, which is suitable for students who brush the questions to study repeatedly and figure out the frame thinking.
In 262 pages, this is a very thoughtful book about programming techniques, linear tables, strings, stack queues, trees, sorting, lookup, BFS, DFS, greed, dynamic programming, and more.
You can feel the contents:
Each chapter will first explain frame thinking, and then select a dozen typical LeetCode problems for practical explanation:
And the book is also very sophisticated, click on the table of contents can jump, will be illustrated:
If it’s learning algorithms, data structures, or just looking for a job, don’t miss it!
The book will soon be published as a physical book, which works best with Github. Only e-books for now
I’ve uploaded this open source ebook to a disk so you can download it,
High frequency algorithm set extraction code: UD0P