Contact Information

Newest articles

Blockchain Coding interviews

Bloom Filters and Bitcoin

Bloom filters are a data structure developed by Burton Howard Bloom in 1970. You can see them as a hash tables’ cousin. They also allow

Merkle trees an d bitcoin
Blockchain Career

Merkle Trees and Bitcoin

Merkle trees, also known as binary hash trees, are a type of binary tree. They can be used to efficiently verify the integrity of large

Hard Dynamic Programming problems
Career Coding interviews

6 Hard Dynamic Programming Problems Made Easy

In this article, I gave you an introduction to Dynamic Programming with several examples. Here I will solve 6 harder Dynamic Programming problems to show

Ways to traverse a tree
Career Coding interviews

Recursion vs Iteration: 13 Ways to Traverse a Tree

To understand recursion, you must understand recursion. I will show you 13 different ways to traverse a tree to compare recursive and iterative implementations. This

Career Coding interviews

All you need to know about Dynamic Programming

What is dynamic programming and why should you care about it? In this article, I will introduce the concept of dynamic programming, developed by Richard


Google Cloud Platform Tutorial: From Zero to Hero with GCP

Do you have the knowledge and skills to design a mobile gaming analytics platform that collects, stores, and analyzes large amounts of bulk and real-time