Contact Information
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 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
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
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
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
What is the difference between a junior and a senior software developer?
When I first started coding I also felt lost and overwhelmed. I thought I needed to focus only on my coding skills to get promoted
How to learn data structures and algorithms. 20 problem-solving techniques you must know
This is the article I wish I had read when I started coding. Programming is about solving problems and here I will dive deep into
How to ace coding interviews. The ultimate guide.
In this article, I’ll detail a comprehensive plan to help you ace the coding interview. I must have been in almost a hundred coding interviews.