HackerRank - QHEAP1
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. It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct elements will be…
View On WordPress

















