My "The Road to Algorithm Clearance" is published!

In fact, many friends asked me privately:

• When will the new book be published?
• Can I book it?
• and many more

In fact, I am more anxious than everyone, but publishing books is really a very rigorous process. Unlike columns, booklets and other electronic books, you can edit them while they are on the shelves. The requirements and processes of traditional paper books are strictly controlled. Therefore, we can only wait patiently and cooperate with the publishing house. And now "The Road to Algorithm Clearance" is finally going to meet everyone! 🌹🌹🌹

Many students have already booked, and some even booked dozens of times, which really moved Xifa!

The following are some of the classmates who have emailed me to make reservations:

Although the content has already been decided, the process is very tortuous. In short, there are various things, but fortunately, it has now been published. Thank you all for your encouragement and support, otherwise I am afraid it will be difficult to stick to it

Let me show you the cover of a new book.

So what kind of stuff is mentioned in this book? Here Xifa will give you a brief introduction. You can scan the QR code at the end of the article to view the detailed catalog.

• Chapter 1 summarizes and sorts out some basic data structures and algorithms. At the same time, it introduces a common method of measuring the performance of programs-Big O notation.
• Chapter 2 is a topic on mathematics. Many algorithm problems require you to have some mathematical knowledge to solve, so what are the required mathematical knowledge and how difficult is it? This chapter will tell you.
• Chapter 3 talks about a classic algorithm problem-the palindrome problem.
• Chapter 4 is the game topic. Game topics can be divided into two categories from the perspective of problems: solution and game. Game problems will be specifically analyzed in Chapter 12. This chapter will focus on solving games.
• Chapter 5 introduces two common search algorithms-depth-first traversal and breadth-first traversal. This chapter will tell you what are the characteristics of the two searches and what problems they are suitable for.
• Chapter 6 will explain the dichotomy, including its basic form, problem-solving skills, and algorithm templates.
• Chapter 7 is about bit arithmetic, which aims to allow readers to think about problems from a binary perspective.
• Chapter 8 talks about design problems. Learning the content of this chapter requires readers to be familiar with common data structures.
• Chapter 9 gives a detailed explanation of two common double pointers.
• Chapter 10 makes a detailed analysis of the classic algorithm-dynamic programming step by step, and introduces a space optimization method-rolling array.
• Chapter 11 is about sliding windows. This algorithm uses two pointers to delimit the left and right boundaries of the window and counts the information in the window. When the window is sliding, only the part of the window change is considered, and the existing calculation results are maximized, thereby reducing the time complexity.
• Chapter 12 is about game problems. The frequency of this type of problem is also very high. Only the problems related to the game of stone have appeared many times in LeetCode. Although there is no fixed way of thinking about game problems, there are some rules to follow.
• Chapter 13 talks about the stock problem, which is a sub-problem of dynamic programming. It is recommended that readers read this chapter after reading Chapter 10 Dynamic Programming.
• Chapters 14 and 15 respectively talk about the divide and conquer method and the greedy method. These two topics are similar to dynamic programming, and the upper limit of difficulty is very high, and it is not easy to master. These two chapters start with a few specific examples to help readers clarify the applicable scenarios and problem-solving strategies of the greedy law and divide-and-conquer problems.
• Chapter 16 is an extension of Chapter 5, introducing another common search algorithm-backtracking. What is backtracking? How to use the backtracking method to solve specific algorithmic problems? How to write the code of the backtracking method? How to optimize the backtracking procedure? This chapter will tell you the answer.
• Chapter 17 is a few interesting topics selected by the author and shared with readers here.
• Chapter 18 contains some problem-solving templates. It is a refinement of the previous content. It is recommended that readers check the corresponding templates in this chapter after reading the corresponding topics. The significance of the template is to increase the speed of problem-solving and reduce the error rate, rather than being used to mechanically copy. Readers should pay special attention to this point.
• Chapter 19 provides as many solutions as possible to expand the reader's thinking, which is different from the previous chapter 18. In order not to affect reading, the contents of the previous 18 chapters are all about a single point of knowledge. At the same time, in order to match its content, sometimes the best solution is given up and the solution that matches the content of this chapter is selected.
• Chapter 20 shares some problem-solving skills that the author thinks are very good.

The new book is here first. Next, I will answer a few questions that everyone is more concerned about with this book. Let's enter the Q&A link!

Q&A

• Q1: What programming language is this book?
• A1: Python. But I provide a supporting website. All codes provide Java, CPP, Python three codes, so if you are not familiar with Python, and only need Java or CPP, there is no problem at all. In addition, some topics also provide JS Code, and we may add other languages based on readers' feedback later.

This book’s supporting website address: https://leetcode-solution.cn/book

• Q2: Is the content of the book the content of the Github warehouse and official account?
• A2: Many readers come from my Github, and Github also provides an e-book version.

Github address: https://github.com/azl397985856/leetcode

So will the content of the Github e-book overlap with this book? The answer is that there is almost no overlap. The content of this book is almost entirely new content that has never been made public. Don’t worry about buying a open source book .

• Q3: Is this book suitable for Xiaobai?
• A3: This book is tailor-made for people who want to study scientifically and efficiently. Reading this book is suitable for people who understand at least one programming language, can convert ideas into code, and understand common data structures. If you are such a person, you can buy it and read it.
• Q4: Is the upper limit of this book high? I want to improve myself.
• A4: The upper limit of this book is not high. The difficulty basically covers easy, medium and partly difficult . That is to say, understanding this book can solve most of the problems. This level is insufficient to meet the algorithm of the game, but cope interview enough .

If you have any questions, you can leave me a message. I will answer everyone as much as possible~ ღ( ´･ᴗ･`) more than heart

Fan benefits

50% discount

It is still in the pre-sale stage, and I am fighting for a wave of benefits for readers of the official account, so that everyone can buy it at a more favorable price.

The new book is priced at 99 yuan, but I helped everyone get a 50% discount, 49.5 yuan can be won, and the first 10,000 books will come with a member coupon.

Friends who want to get started are now very cost-effective, scan the QR code below (or use this link https://u.jd.com/gKbUGbR) to buy.

Free book delivery

In addition, Likoujiajia draws three fans among the fans for free! In the future, we will draw a lottery to send books on this account from time to time, so you can pay attention to it!

Please read carefully how to participate:

1. In the , add and send the 2 words [Raffle] (without any symbols or emoticons) to participate in the lottery.

Click to follow the account at the top and reply to the [lottery draw] to participate

Reminder: It is in the backstage of the official account, not in the comment area, not in the backstage of this account, nor is it sent to WeChat.

2. At 12:00 on September 9th, will draw automatically. WeChat will automatically notify you after the draw.
3. The lottery will be drawn by a third-party platform. If you have any questions during the lottery and redemption process, please add the secretary WeChat (WeChat ID: wxid_d5q3rgueie4r22)

In addition, the front end of the official account Brain Hole is also doing the same lottery, and you can also participate in the lottery by replying to the lottery in the background of the Brain Hole front-end. participated, and the winning rate doubled!