All about coding interview procedures, questions, and examples. We might solve some coding questions or just talk about how to prepare for one.
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?
This is a somewhat common interview question that asks the following. Consider there is an array holding sorted numbers in an established range. For our example, we’ll propose numbers ranging from 1 to 100. No duplicate elements are allowed. Also, there is only one element missing. What is that element? Or to rephase it – how to find the missing number in a given integer array?
“The Promise object represents the eventual completion (or failure) of an asynchronous operation, and its resulting value.” Mozzila documentation Promises can be considered the new cool kid in the block (although the concept of promises and execution synchronization is almost 40 years old, you can… Read More »Asynchronous JavaScript with Promises
When I just started surfing yeeeears ago I started tinkering with websites, trying to manipulate them into giving me the good old 404 error, often delivered with a funny (or even nasty) static HTML document. Little did I know that the number 404 is just… Read More »The most important HTTP status codes
In mathematics, the logarithm is the inverse function to exponentiation. That means the logarithm of a given number x is the exponent to which another fixed number, the base b, must be raised, to produce that number x. Wikipedia Introduction If you want to see the original post and refresh your knowledge on Big O notation please click… Read More »What is the logarithmic runtime O(log(n))?
Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. Wikipedia Introduction Even if you’ll never use Big O in your professional career, it is still important to know what it is. And it can be valuable… Read More »What is Big O and why is it important?