Skip to content

Phase 2

Likoujiajia, a team that strives to solve the best algorithm problems in Xihu District. Just today it brings you "91 Tianxue Algorithm" to help you get rid of the predicament and conquer the algorithm.

Original intention

In order to let those who want to learn can really learn things, I plan to open a new column "91 Tianxue Algorithm", within 91 days to help those who want to learn algorithms, improve their algorithm skills, and help everyone build complete algorithm knowledge. system.

There will be questions every day in the group, I recommend everyone to discuss the topic of the day. We will help you plan your learning route and witness a different self in 91 days. There will be a dedicated senior algorithm competition boss in the group to answer everyone's questions and questions, and will explain the topic of the previous day.

Activity time

2020-11-01 to 2021-1-30

What can you get?

  1. Significantly improve your efficiency of writing questions, so you can avoid detours
  2. Master the ideas and solutions of common interview questions
  3. Grasp common routines, understand the nature of common algorithms, and compare various topics horizontally
  4. Analyze a problem longitudinally, solve the same problem in multiple ways from different angles

Claim

-🈲️ Do not allow frequent small talk -🈲️ Advertising and soft articles are not allowed (only technical articles related to algorithms can be posted) -✅ Participate in check-in at least once a week

Those who violate the above conditions will be forced to be discharged

Course Outline

The first part of the public lectures:

-[91 Algorithm-Basics] 05. Double Pointer -Why draw tables for dynamic programming problems?

In the second phase, the topics and handouts will be processed again, and the quality will be changed, so stay tuned~

Basics (30 days)

  1. Arrays, queues, stacks
  2. Linked List
  3. Trees and Recursion
  4. Hash table
  5. Double pointer

Advanced articles (30 days)

  1. Heap
  2. Prefix tree
  3. Consolidation
  4. Jump table
  5. Pruning techniques
  6. RK and KMP
  7. Frequent interview questions

...

  1. Dichotomy
  2. Sliding window
  3. Bit operations
  4. Backpack problem
  5. Search (BFS, DFS, backtracking)
  6. Dynamic programming
  7. Divide and Conquer
  8. Greed

...

game rules

-According to the plan of the course syllabus, a related topic will be presented every day. -You can check in in the designated private warehouse (you can't copy homework), and you can ask questions in the group for questions that you can't do.

Originally planned to build a website, but there are some unexpected situations later, but for the time being, I will use the Github private warehouse.

-On the second day, the topic of the previous day will be explained.

reward

-For students who insist on punching in for a full month, they can participate in a lottery. The prizes include ʻalgorithm simulation interview`, algorithm-related books, scientific online redemption codes, etc. -Check in for seven consecutive days to get a replacement card

Red duck

The registration start time is to be determined.

We use the WeChat group method. The first 50 small partners who enter the group are free~, and the small partners after 50 take the form of tiered fees.

Charges:

-Free for the first 50 people -51-100 charge 5 yuan -101-500 charge 10 yuan

Friends who want to participate add me and send red envelopes to pull you into the group.

-WeChat ID: DeveloperEngineer

**It should be noted that no matter which number you are in the group, you need to send a red envelope before you can join the group. It's just that after you join the group, you find that there are less than 50 people, you can contact me to cash back 10 yuan. If you are more than 50 and less than 100, you can find me 5 yuan in cash back. **