One of my friends gave me a feedback, because I didn’t do the algorithm hard question well, HR reported that the interviewer gave a “bad comment” on the spot, so I missed the offer perfectly.
In fact, if you want to meet ali, Byte and other big manufacturers, the probability of running into algorithm hard this year is very large.
The difficulty of the algorithm increases, and more and more deformation problems
This year, many students feedback that the difficulty of the interview is generally higher in large factories. Since there are many original questions on the Internet, big companies often change some conditions in the original questions, or use variations to test candidates. Take this question for example:
Solution:
QuickSelect, each time using the number P in the middle of the current interval as the threshold
Numbers less than P go to the left, numbers greater than P go to the right
If the number of numbers on the left is greater than or equal to K, recurse to the left
If the number of numbers on the left side +1 is less than K, recurse to the right side, K- is equal to the number of numbers on the left side +1
Otherwise output P average time complexity O(n), worst time complexity O(n2)
Follow up follow up follow up follow up follow up follow up
● Given n unsorted arrays, find the KTH largest number ● Given a matrix that increments every row and every column, find the KTH smallest number ● Given two sorted arrays, find the KTH smallest number in all pair-wise sums
A lot of friends will go blank even if they brush the original problem. The most fundamental reason is that the original topic did not understand, do not know how to master the knowledge of the summary of the system.
However, while the number of questions is increasing, the types of questions are not. As long as you understand the rules of Follow Up, the problem will be solved easily.
Nine chapters intensive algorithm class
Algorithm intensive class is “nine chapter algorithm class” advanced course, can help you build algorithm model, more comprehensive grasp of advanced algorithm and data structure knowledge, cover most of the algorithm problem, teach you to learn a problem, will be a class!
Even with more difficult data structures, dichotomies and scan lines, dynamic programming, and follow up problems, you can easily pass!
Gold tutor precise topic, easy to solve the challenge of large factory development, job hopping and salary rise necessary lessons
Now you can sign up for a free audition
Course points
● New solutions and more difficult algorithms: Tire, and lookup set, monotonous stack, dynamic programming optimization ● Topic ideas summary, by inference: solve follow up ideas and ideas process
Suitable for who
● Students who hope to get offers from Google, Facebook, Amazon and other big IT enterprises ● Students who cannot effectively solve medium problems, deformation problems, and follow up problems ● Students who have taken nine chapter algorithm class, ● Want to learn more about data structures and algorithms, and improve the knowledge system of algorithms
On the teacher
Mr. Hou, the top silicon Valley tutor, taught with a lamp,
From the solution to the algorithm template in one stop,
The students on the class are full of praise 👇
Free auditions
Stamp me to sign up for free audition
Sign up now to try the first interactive lesson for free. Sign up now to try it now. The content is as follows:
FLAG algorithm interview difficulty increased? How to prepare?
- The difficulty and style of interview algorithm for various IT enterprises
- How to solve arithmetic problems above medium difficulty
- How to solve the Follow Up problem
- Two Pointer – Forward Pointer – Two Pointer Problem
- Minimum Size Subarray Sum
- Longest Substring Without Repeating Characters
Longest Substring With at Most k Distinct Characters
- Minimum Window Substring
- Kth Largest Problem
- Three layers of progressive interviews for the k element.
- How to distinguish three types of interviewees by one question
- Analyze the interviewer’s thinking during the interview