The interviewer doesn’t want you to code in silence for ten minutes and then say that you finished. The approach I suggest here, is very simple. It’s up to you to increase your problems comfort zone. Wait with this for 2 minutes, and run the examples in your head. Make the interviewer really understand what you want to say, and don’t assume he gets bored while hearing to you. Most people stay quiet for three minutes while thinking of a solution, and that is the worst strategy possible for them. Practice on making a copy of the graph in memory and detecting cycles in graphs. One interview takes roughly 45 minutes and you are given one or two coding problems. So, the first thing when you receive the problem is to make an idea of the data structure that you need to use. This topic refers to problems where the array is used just for storage and the solution includes basic techniques, such as iterating with two pointers. He wants you to talk aloud and explain everything that you write. Solve this challenge: Implement a Stack with a MAX API, meaning that at every moment you can ask what is the maximum element in the stack. Comments first approach for solving a coding question in a job interview. The interviewer is truly interested in finding more about you, so start with a concise introduction of the project, explaining what it’s about. I really encourage you to ask at least two questions. or “How was your first week here?” or “Do you get to choose which project to work on?” or “What project do you normally give to interns?”. Don’t be one of them! They are equally important and if you master both, then you’ve passed the interview! I’ve written them in order of their importance and it is the best learning path. How can you count the number of 1’s in a binary representation? This part commences the interview and takes about three to five minutes. Understand what it means and arrive at the point when you can say the complexity of a basic algorithm just from looking at it. So simply say: “I see that there is a bug. For example, forgot if the index is the first or second element in a foreach loop. It is perfectly fine to have a 90% bullet proof code. Ask questions in the end! If you are applying for a programming position, one thing is positive – you will be asked to write some code. I will try to do my best to explain. Know very well their best, average and worst case complexities. You can reach me here. My favorite frontend job interview question – hangman, You are by yourself (no Google, no documentation), There’s no autocompletion by your favorite IDE, The deadline is very short – there’s pressure in the air, You have to think real fast about the solution, Care about performance and complexity or at least have it as a consideration in mind, Express your familiarity with the language, its tricks and limitations. About the author: Andrei Margeloiu is a passionate programmer interested in entrepreneurship, startups and history. So, you need to understand that the single variable of passing the interview is how much you practice before. Sorry, didn’t find a technique for that yet . This is the question we are solving – my own original, copyrights protected, SHLOOF BLOOP (does not resemble to fizz buzz in anyway! The reason is simple: he doesn’t know what you are coding if you don’t explain. 11) Heaps: They are widely used in real world application, so get to know heaps! The article has three parts & three videos and it will take around 30 minutes to read. This is the recipe: Understand the question and ask for clarifications. Subscribe here, we promise not to spam :). I was responsible for coding the backend in Node.js and database in MongoDB. 14) Binary Search Trees: They are widely asked in the coding interview, and you need to be able to implement all their basic operations, including the deletion of an element! And here we came, the moment after you finished coding the problems. 5 Common Mistakes in Web Developers Resumes, How to solve a coding question in a job interview? I learned many things from this project, especially how to work in a team. Your experience, intelligence and everything else is already fixed. So, practice the top five most common questions and stick with them until you understand where the recurrences come from. The developing process was iterative, and we made some mistakes on the way. Now, this is your chance to shine, so don’t waste it! 17) Dynamic programming: Dynamic programming is seen by most as the scariest topic. 1) Big O complexity: It’s a must and forms the underlying foundation of your algorithmic thinking. Does it cover the edge cases it should? Now the interviewer will give you the chance to ask him any question that you might be interested in. I said ‘briefly’ because he won’t give you many details about the constraints, corner cases or how you receive the data. ), and what you learnt from the developing process. You should talk one-two minutes about your project. Read this first, and then come back here. Your job is to repair the code by yourself. Me and everyone else hate those people, so be sure you show your true personality. 4) Linked Lists: It’s common to encounter a linked list problem in the interview. You got the green light from the interviewer? So if you really want to crush that interview, go and practice after reading this article. So, feel free to judge me as a candidate and leave a comment if something doesn’t make sense. Let’s dig into the code. This led me to code while I am thinking. In short – in this way I am sure I will have a well commented code, and even if I won’t have time to implement everything, the interviewer will know how I would solve it if I’d have more. 16) Graphs: They are probably the most used data structure in computer science. And hopefully code review and more useful techniques to make your code robust, readable, maintainable and… working. Don’t skip them. Take a moment to think about the solution. Which answer do you like more? This part is not all about coding, it’s also about talking loud and explaining what you are coding. I’ve participated in the World Finals of Google HashCode, the largest algorithmic competition organised by Google, and before that, I won three Gold Medals in the Computing Olympiad in Romania. Update: Following the advice wrote below, I got offers from Google, Microsoft, Amazon, Quantcast and Bloomberg. But it’s the most beautiful if you understand the thinking behind it. 10) Binary trees: Focus on traversals, common ancestors and recursively iterate through the trees. Turn this presentation into your advantage! Needless to say – I wrote the code before I had the complete solution in mind.While this can work in some cases, it can be not such a good idea: It can work of course, and many people think while they code in real life But in an interview you don’t have time for so many deletions and retries.