Different companies can have very different emphasis on algorithms during coding interview. Nevertheless, if I had only 10 minutes to prepare for recruitment meeting, I would most definitely spend it on learning recursive version of Fibonacci sequence - it simply turns up the most often. In this post, I am providing you with “transcript” of the first time I was asked to implement Fibonacci sequence algorithm in Python few years ago. Take a look at the way I was thinking out loud and try to mimic this approach during your job interview even when different algorithmic task appears! Read more "Mastering Most Common Interview Question: Fibonacci Sequence"
When you are faced with a huge task, what do you usually do? Well, if you’re a little bit like me, then you split it into smaller chunks, complete them individually and later combine into a bigger one. This exact approach is used by Merge Sort. Following article will cover its implementation with detailed explanation, including a study of dreadful (not really) recursion. Ready? Read more "Merge Sort - Divide and Conquer"
Binary Search was one of the first algorithms I learned. It’s widely used in real-world scenarios and questions about it appear quite often during junior job interviews. I love its simplicity, intuitiveness and power. In this article I’ll do my best to take you by hand straight into the beautiful world of algorithmic thinking. Read more "Binary Search - Perfect Start of Algorithmic Journey"