Remember Heaps
Today’s Cracking the Coding Interview Challenge is Heaps: Find the Running Median. Heaps have always been a confusion for me. Today is the day to end this!...
Recent Posts
Review Binary Trees and Binary Search Trees
Hi guys, In this post I will review the BT and BST topics. I’ve seen this problem in the Cracking the Coding Interview Trees: Is This a Binary Search Tree?...
Implementing a Queue from Two Stacks Algorithm
Hi guys, In this post I will talk about the implementing a queue data sturcture from existing data structures called stacks and I need to use two of them. I...
Java Cycle Detection Algorithm
Hi guys, In this post I will talk about the cycle detection in linked lists. I’ve seen this problem in the Cracking the Coding Interview Linked Lists: Det...
Java HashMap vs. HashTable
When I was solving the third challenge in Cracking the Coding Interview tasks in hackerrank, I’ve come accross with HashTables. Then I realized that I forge...