Frankly speaking, I would rather take the elevator, except when an interviewer forces you to take the stairs. It isn’t fair that you have to exert so much physical effort. On top of it, you have to remember that every step has an underlying penalty. Rules of engagement: Your task is to reach…

You may know about the Avengers, the A-team, the Expendables, the Fantastic Five or the X-men. However, none of these superheroes can get past the “Falsy” club. They are the values that can prevent your condition from passing, no matter how mighty you are. A simple cheat sheet to help…

Sometimes what you need is a reality check, and I am here to give it to you. In the days of positive thinking, self-affirmations, and the law of attraction, we are not thinking about the bad things that can happen in our life. It is easy to get sucked in…

Not an interview from the tech giants goes by without a question from Dynamic Programming. It is kind of a fancy name for memorization or storing values for future references. Would it take time for you to calculate the Fibonacci of 100? Would it take much time to calculate the…

Say you wanted to code up an implementation of a dictionary of English words, then how would you approach this problem Approach 1: Using a LinkedList or an Array In order to check the definition or presence of a word, we would have to iterate over all the words sequentially, and the…

Say you are required to code up: (a ^ b) % c Now why do “% c” after exponentiation, because a ^ b will be really large even for relatively small values of a, b and that is a problem because the data type of the language that we try…

Fibonacci series: fib(n) = fib(n-1) + fib(n-2) → for n > 1 fib(n) = 1→ for n = 0, 1 Fibonacci can be solved iteratively as well as recursively Recursive approach: The recursive approach seems to be much simpler and smaller, but there is a caveat, as it is calculating the Fibonacci…

The factorial of a number is defined as: f(n) = n * f(n-1) → for all n >0 f(0) = 1 → for n = 0 factorial(n): if n is 0 return 1 return n * factorial(n-1) C++ code: Time complexity If we look at the pseudo-code again, added below for convenience. …

If you have an array that is circular, i.e. the next element of the last element is the first element. To find the next and the previous index we are going to rely of the modulus operator. if N is the array element, curr is the current index in a…