Algorithms: Animation Display

Did you pass the interview algorithm question? Learning algorithm questions takes too much time? Not your problem! Before this, no algorithmic learning method could be so simple and efficient.
It only takes three steps to become an algorithm master:
The first step is to read the question;
The second step is to play the animation, refer to the subtitles, and understand the ideas and codes;
The third step is to read, analyze and summarize;

Why do you make an algorithm animation diagram app?
Like many programmers, I have to prepare a lot of time to brush up the algorithm every time I change jobs. Very good, in the process of brushing the questions, you must first read the solution. I also read a lot of problem solutions from big guys on the Internet, and I especially like to read algorithm analysis with moving pictures or schematic diagrams, which is faster than reading text. In the process, several problems were also found, such as: the animation is not interactive and cannot be paused; the data is dead and cannot be changed; it is not convenient to study on the mobile phone, etc.
I saw some good animations at the beginning, and I had a strong urge to implement them in the app with native code several times. This time I finally made up my mind and made 70 animations in one go.
I understand that the positioning of this app is a tool that can help us quickly understand algorithm ideas and codes, help memory, and improve learning efficiency. But here you can't submit, you can't execute the code, and the code still needs to be typed on the computer to make it feel better.

Why is it not arranged in the order of the leetcode number?
At present, the algorithm questions are classified into three major blocks:
- linked list, string, array, binary tree;
- Backtracking, greedy, dynamic programming, divide and conquer;
- Sort and classify separately.
Under each category, the difficulty is divided into easy, medium and hard.
First classify data structures and algorithms separately, and learn according to knowledge points. For example, you can concentrate on learning binary tree structures or dynamic programming algorithms, so that concentrated saturation training can help improve learning efficiency. The data structure comes first, and the algorithm follows, which is also arranged in the order in which we learn theoretical knowledge.
In terms of algorithms, four types ar