1 of 3
You Can Easily Build a Scalable Data Pipeline With Apache Airflow: Here’s How.
If you want an easy way to build and manage a data pipeline, Apache Airflow may be the tool for you. Apache Airflow provides a simple way to write, schedule, and monitor workflows using pure Python. In this blog post, I’ll cover Apache Airflow core concepts and components and then build and operate a simple data pipeline.
My current site infrastructure using Kubernetes
I moved this personal site into a Kubernetes cluster hosted on Google Cloud Platform (GCP). This post will give an overview of my current infrastructure.
Quick Sort in C
Quick Sort is one the most common sort algorithms. Quick sort variations are commonly used as the sort implementation in a language.
Create a Heighway Dragon Curve with React
Learn how to use a L-System to develop many fractals. In this case, I will specifically cover a Heighway Dragon Curve. L-Systems contain an alphabet and rules changing the alphabet each iteration to describe a complicated fractal.
Sync a directory with a Synology NAS
Follow my tutorial to set up an automatic folder sync with a Synology NAS using python. The NAS also automatically syncs with a linked dropbox account. This requires computing a directory index, both on the local computer and on the NAS. Then comparing the difference.
Linked Lists: Detect a Cycle
Crack the code interview from Hackerrank by detecting a cycle in a Linked List. Linked Lists consist of nodes that are connected through a pointer and they contain no index. A cycle is when one node points to a node that has already been reference which causes the order to repeat.
Sorting: Bubble Sort
Crack the code interview from Hackerrank by implementing the simple sorting algorithm - Bubble Sort. Bubble sort is generally considered the simplest sort and the easiest to remember but is slow.
DFS: Connected Cells in a Grid
Crack the code interview from Hackerrank by utilizing Depth-First Search (DFS) to calculate the size of the largest region of a connected cells in a grid. DFS starts at a root node and works directly down a single branch until reaching it's deepest level before returning back up and progressing along other branches.