Implementing prefix trie
Introduction: A prefix trie is a tree data structure that stores strings that is prefix searchable. The nodes of the tree are actually the elements of the a...
Recent Posts
Implementing binary heap
Overview A binary heap is a complete binary tree that satisfies the heap property. There are two main ways to represent binary heaps: Array representati...
Introducing observability with prometheus
Using open source observability tools like prometheus, it is convenient to track and understand how your application performs, especially if cloud providers ...
Reintegrating streaming with php legacy service
A while back, I was tasked to look into the problem of disappearing events in a streaming pipeline. The stakeholders complained of the data/status not being ...
Historical Data and Near Real Time Data are not the same!
When extracting data from a third party api service that generates a lot of data - the amount of work needed to then maintain the stored data starts to compo...