The other day I stumble upon the question to find the kth largest element in the array. At first glance, I thought the solution was trivial. But later I thought that there are multiple ways to achieve efficient solution
Heap is a useful data structure when root of the tree is important. Extracting an element from the heap is in logarithmic time. This could be used to find kth element from the array since finding maximum or minimum in heap is constant time...
It was just another day in Bangalore. I caught the bus from the Kormangala bus depot. Amid exhausting heat & nudging elbows, I somehow managed to grab a seat in the bus. Securing a seat in the Indian bus during peak time is considered a fortune. This often attracts resentful eyes. However my Indian genes have made me immune to both pani puri & judgment.
If you are lucky, you could get a window seat. This saves you from claustrophobia of the overcrowded isles. And today was my lucky day. I happily slumped down into my seat and peeped out of my window catching some glimpse of just another life on just another
Browsers have made browsing insanely easy. Toolbar fetches webpage magically. However, under the hood, lots of
requests are exchanged. These requests are based on
What is REST? REST is REpresentational State Transfer. Loosely speaking it defines how resources are exchanged based on item of request. Two most common HTTP Request Methods are
GET. Using tshark, we can see the headers exchange as you browse the web...