DEV Community

Cover image for Junior interviews are broken: a few hints to succeed nevertheless.

Posted on

Junior interviews are broken: a few hints to succeed nevertheless.

In countries worldwide, the promise of finding a job quickly and easily for new IT graduates is culturally embedded. Unfortunately, this promise is not necessarily real. The IT development market is sorely lacking in developers, yes, but not in junior developers. Only professional profiles are in demand, and companies, especially since the crisis, are reluctant to give young people a chance.

However, suppose you manage to find a company that agrees, at the very least, to meet you for an interview. In that case, you will have to complete the technical test.

The technical test.

Expected by some, dreaded by others, the technical test aims to gauge your skills, to take stock of your strengths and weaknesses.

Unfortunately, since the disclosure of technical tests from companies such as Google, Facebook, and Amazon, these tests' difficulty has drastically increased, even for juniors.

The technical tests we're going to talk about today originate from FAANG's interviewing practices. We will not discuss other methods but share in the commentary the different interview methods you may have taken part in!

It's all about the algorithm.

Mastering algorithms will be a significant component of your interview success. It is not uncommon - and unfortunate - to see algorithm-oriented testing in interviews for front-end developers who will have very few algorithms to perform.

Your ability to solve complex problems, to analyze and break down a complex problem into more straightforward problems will be crucial.

Therefore, you need to know, at a minimum, examples of data structures such as tables, queues, or graphs. Besides, excellent knowledge of how to manipulate these data structures will be essential.

In addition to these data structures, concepts such as temporal complexity or cyclomatic complexity must be considered. Temporal complexity, generally noted O(n), will allow you to measure your algorithm's execution time. Cyclomatic complexity will allow you to measure the complexity of your code.

Acing the interview.

To learn these notions and make your interviews a success, a whole range of online solutions, some free and some paid, can help you.

Among the free solutions, you will find sites like Hackerrank (my favorite!), LeetCode, CodinGame, or Coderbyte. Some of these sites will allow you to obtain certificates. Others even offer to find a job directly through the platform.

My favorite paid solution is AlgoExpert. AlgoExpert was created by Clément Mihailescu, a French-American entrepreneur who worked at Facebook and Google (and therefore passed the interviews!) before launching AlgoExpert.

In the next articles, I will explain step by step the solution to some of the known algorithms that you will find in interviews, so don't hesitate to subscribe to my profile!

👋🏻 Thank you for reading me; feel free to tell me in the comments how your interviews went and what were the problems you encountered.

Discussion (4)

eonuk profile image

I've never really had technical interviews (actually coding in front of them) except once - and I failed miserably from lack of preparedness. I do actually think they are a bit pointless, but interviews are really just about "jumping through hoops". You have to perform tricks, and not raise red-flags, and just hope the other candidates do trip up

arthureichelberger profile image

Thank you for your comment!

I agree with you! The interview where you had to code in front of them, was it more algorithmic oriented or rather on a rather "real" feature?

arthureichelberger profile image

And that's fine! In France, especially in Paris, some companies want you to know all this so you can move a 3px button to the left, and in my opinion, this is pure nonsense!