This guide discusses the best ways to answer binary search interview questions and how to understand binary search at a high level.

If you’re interviewing for a developer position, one of the more intimidating questions that you can be asked is to explain how the Quicksort algorithm works. It’s a popular interview question by companies such as Facebook and Google, so I thought it would be a good one to cover.

Today I’m going to walk through an easy way to understand decision trees.

Today we’re going to cover one of my favorite algorithm design patterns, the divide and conquer algorithm process. There is a very practical reason why divide and conquer algorithms are so popular. And I’m going to discuss those reasons in this guide.

Today I’m going to discuss how to create a binary search tree from an array.

When going through the coding interview process, the topic of sorting algorithms arise regularly. Which begs the question of: why are sorting algorithms important to understand as a developer?