This week we’ll be talking about merge intervals. These series of problems stick out like a sore thumb when it comes to LeetCode questions. They are oddly specific. It is always about have several “intervals”, represented by a two dimensional array of numbers. Each array within our array contains two numbers or timestamps. The problem […]

We’re onto our next pattern, which turns out to be quite an important one for interviews: the sliding window pattern. We have kind of touched upon this a little bit while solving problems related to the two pointer pattern, but this time we will be completely focused on this. This pattern comes in handy while […]

We are onto our second pattern for LeetCode style interviews this week: the fast and slow pointer patter. Although technically still a two pointer pattern, there’s a specific style to this where one variable moves at a certain speed – perhaps one element at a time – and the other variable moves two at a […]

We will be continuing our study of the two pointer pattern for solving LeetCode questions in this post. Let’s begin! Problem #14 – Triplets with Smaller Sum We are still on the genre of problems involving triplets i.e. three numbers in an array that satisfy a particular condition. In this case, we’re looking for three […]

In today’s post, we will take a look at the two pointer pattern for solving problems. This pattern is really useful for traversing arrays, strings, and linked lists. The two pointer approach also encompasses binary search since these terms are really loosely defined. Let’s take a look at a set of problems that can be […]

These blogs are going to tackle a series of LeetCode problems using the Python programming language. Each part is going to tackle data structure and algorithm patterns used heavily in software engineering interviews. The goal of these blog posts is also to highlight some neat programming tips and tricks, when using Python to solve these […]