Coding Patterns

This week I decided to focus on Breadth First Search (BFS). It’s a topic that I personally haven’t looked at in a while, so it seemed like it would be a great refresher to review it. I found this very helpful guide on stackabuse.com. According to stackabuse.com’s guide, BFS is an algorithm for traversing a…

This week I decided to study a coding pattern called Fast & Slow Pointers. According to Philip Wilkinson, a Linked List is a type of data structure that acts as a linear collection of nodes, and each node contains some information and a link or reference to another node. It was time for me to…

This week, I learned more about the Two Pointers coding pattern. I came across this pattern when I was already looking at the problems tagged under Sliding Widow, which I focused on in another blog post. That’s when I decided to take a look at Two Sum and Contains Duplicate II. These are both considered…

This week I’m studying the sliding window pattern. According to Sergey Piterman, this type of coding pattern is commonly used in array or string coding problems, where you are looking at a moving sub-list of a string or array, which runs over an underlying string or array. Piterman says the types of problems that you’d…