2022-11-28
|~3 min read
|413 words
Many moons ago, I had an interview where I was asked to find the x smallest value in a list. Javascript makes that fairly easy, however, my…
2022-11-28
|~7 min read
|1245 words
When it comes to searching a tree, there are two general approaches: depth first and breadth first. This post will discuss the former and…
2022-11-28
|~12 min read
|2305 words
When trying to determine the trend in a set of data, there are a number of different solutions that can work. A naive approach often…
2022-11-28
|~2 min read
|389 words
Yesterday, I wrote about determining whether a Binary Search Tree was valid using a depth-first approach. I made an off-hand comment about…
2022-11-28
|~6 min read
|1137 words
A Binary Search Tree is a pretty ingenious data structure. One simple rule can help organize data in such a way as to make it rapidly…
2022-11-28
|~5 min read
|911 words
Continuing my toy problem practice, today I worked on a path finding problem. Given a two-dimensional board of integers, find the largest…
2022-11-28
|~3 min read
|473 words
What Is The Sliding Window Technique? The sliding window technique refers to a way to solve a problem using dynamic programming…
2022-11-28
|~4 min read
|613 words
Javascript’s built-in sort is powerful and fast. However, there are many times when you will want to sort in a custom fashion. Whenever I…