I still remember the first time Big O notation really landed in my mind. Before that, algorithms felt like recipes. You follow the steps, you get the output, done. But in a data structures class, the conversation changed. It was no longer only about does it work? It became how does it grow? What happens […]

Fibonacci Meets Huffman Coding: Building and Visualising Optimal Prefix Trees in Python If you have ever studied algorithms, you have probably seen both the Fibonacci sequence and Huffman coding. At first glance, they seem unrelated: Fibonacci is a number sequence that appears in math, nature, and dynamic programming. Huffman coding is a compression algorithm used […]

A few days ago, I stumbled upon a fun little challenge: extract the passport holder’s name directly from a scanned passport image. At first glance, it seemed simple: just run OCR and grab the text. But if you’ve ever worked with OCR, you know the output can get messy. So I rolled up my sleeves […]