Author: Andrew Evans

Documentation is always a challenge in the world of Software Engineering. Often times documentation is the last thing that gets done, and it’s hard to keep it updated. Some people make the argument that the code is the documentation, but you still need guides and other instructions for people to use your project. One big … Continue reading How I used Python to Collect Project Documentation →

(image source) Recently I was working on some Leetcode problems and I found some variations of the "longest substring". Normally, you'll be presented with a string and be asked to find the longest substring within the string that does not contain duplicates. More difficult variations of this problem result in more variations of the substring … Continue reading Finding the Longest Substring Challenge →

(image source) I'm a frequent user of Slack and today I found out a cool way to customize the colors of your background and overall theme. I'm going to discuss how to make your Slack installation use a dark theme, but if you review what I have here (and do some googling) you can find … Continue reading Customizing Slack Background and Themes →

(image source) I worked through a recent code challenge and wanted to write about it. The challenge was to evaluate a tree and identify nodes that don't have parents or only have 1 parent. The data would be presented to you as a 2D array and be similar to the following: 1 4 8 10 … Continue reading Algorithms: Searching an Unbalanced Tree →

(image source) Previously I've written posts on both Depth First Search (DFS) and Breadth First Search (BFS) algorithms. I also wanted to write a brief post on Binary Search. Please note that I'm going to be sharing code in Java. Binary Search is an optimized search algorithm that takes advantage of the case when data … Continue reading Algorithms: How to use Binary Search →

(image source) In my previous post I had covered Depth First Search (DFS) to search a graph. Here I'd like to cover Breadth First Search (BFS) and show the difference. Please note my code and examples will be in Java. Depth First Search goes as far as possible into a tree or graph when iterating … Continue reading Algorithms: How to use Breadth First Search →

(image source) Recently I've been reviewing some Algorithms, and was specifically looking at ways to search a Graph with Depth First Search (DFS). I thought it was kinda cool and wanted to write about it. Many times in code challenges or academics you'll be presented with a situation where you have an image or a … Continue reading Algorithms: How to Search a Graph with Depth First Search →