1. Coding Style:
2. Prepare Algorithm Round:
2.1 Unit Test:
The best platform is definitely LeetCode. But I would like to recommend you to do the LeetCode question locally with writing unit tests for each one.
Because there are opportunities that interviewers will ask you to write unit tests during the interview. Besides, writing unit tests is a good practice.
If you find some data structures are missing and you need to implement them by yourself you can always find the example in the following repositories.
This is the coding implementations of the DSA.js book and the repo for the NPM package. In this repository, you can…
2.2 Repeat! Repeat! Repeat!
It is very common that you cannot resolve the question you have resolved previously. Given my experience, the best practice in this situation is to do the question around 4 or 5 times.
Let’s take Two-Sum as an example. For every single question, you should follow the Ebbinghaus memory curve. After resolving the question the first time do that question again on the following day, in the next week, and in a month's time.
There is no shortcut to master the algorithm interview. Just keep practicing and repeating.
2.3 How to choose Algorithm questions
There is a feature in LeetCode premium you can choose the question set under a particular company. Normally these groups of questions cover all the algorithm categories.
3. Prepare Vanilla JS Coding Challenge:
This course has an associated GitHub repository with solutions. You can resolve the challenge by yourself and then check the solution.
If you find the 30 questions above are not enough or you just want to do more challenges you can check this GitHub repository as well.
Hope this blog can save you some time while preparing for your next coding interview and secure a better opportunity. Apart from the above resources I highly recommend you to do some mock interviews online or with your friends.
This blog doesn’t cover how to do take-home assignments as I find that might be a big topic worth writing a separate blog. I will write another one for it. Thanks for reading hope you like it.