Classes are starting soon,
Contact a Drill course consultant and follow us for the latest updates.
Learn more
Scan to add a consultant
Scan to add a consultant
A few months ago, I was in Drill insight every day, discussing projects with my classmates, fighting with code and algorithms every day… Every day, I was doing the same thing…
At that time, for me, even an offer from a small company, not to mention an offer from a big company, would make me excited… However, at that time, I did receive an offer from Linen, which was undoubtedly a big surprise for me at that time!
What impressed me most was the day of the interview… I was really super nervous that day, I'm not a sweaty person, but that day, I don't know how many times I wiped my hands because of sweaty hands…
At the beginning of the interview, HR directly threw out a question related to data structure, “Suppose you have an array containing a large amount of data, what you need to do is to quickly find the maximum value and minimum value, what will you do?”
The moment I heard the question, I was confused, of course it wasn't a question of the topic, or a question of the atmosphere being too serious. But I tried to keep myself calm, tried to search in my mind all the things I had learned in Drill insight, and finally I tried to answer it with Divide and Conquer… It was a bit of an ordeal, but I managed to solve it…
After HR finished reading my answer, he threw out a more in-depth question, “Suppose you are working on a Big dataset and need to perform frequent lookups on it, which data structure would you choose to use and why?”
After the second question came out, again and again and again, I was left pondering… I have learned many data structures, such as Hash Table, Red-Black Tree, etc., but each data structure has its applicable scenarios and advantages and disadvantages. Later I tried to analyze several most probable data structures according to the characteristics of Big dataset and the needs of lookup operation, and gave my reasons for choosing them.
HR seemed to be satisfied with my analysis after listening to it.
Next is the third question, the other party gave a question about algorithm optimization, “Suppose you have a Sorting Algorithm, but its time heterogeneity is O(n^2), how would you optimize it to O(n log n)?” This problem is difficult for me… And it's still not difficult…
Because when I was in Drill insight, of course I studied algorithmic types of questions, but I just never went deeper into their optimization process… Then I tried to start from the most basic ideas, combined with some common optimization techniques, such as Divide and Conquer, Recursion, etc., to derive possible optimization solutions step by step.
In the next few rounds of interviews, with the solid foundation I learned in Drill insight and my accumulated experience, I solved a series of tough questions given by HR one by one, and finally I successfully got the Amazon Offer~!
I think it's really hard to walk this road, but persistence and hard work are really important! It's also important to meet a good teacher! So I wish you all the best!
