Home

Latest from the Blog

HackerRank – QHEAP1

Overview In this article we will try to solve one of the problem from HackerRank, it’s called QHEAP1. There are types of query: ” 1 v” – Add an element v to the heap.” 2 v” – Delete the element v from the heap.“3” – Print the minimum of all the elements in the heap.Continue reading “HackerRank – QHEAP1”

Get new content delivered directly to your inbox.