This article explains the A* search algorithm using a simple, working example in Go. It covers the core concepts of pathfinding and heuristics, shows how to model graphs and nodes, and includes complete code with explanations. Ideal for beginners or anyone curious about how A* finds the shortest path efficiently.

How to turn a fragile, outdated ETL setup into a robust, automated data framework — improving reliability, observability, and developer experience.

From the series IT classics, I am presenting a quick introduction to the QuickSort

How to help your son to understand what is coming this week.

For a 2-year-old, brushing the teeth is very often boring. We created a sticker board to help us out, and the result was quite great.