Max of All Subarrays of Size k Using Max Heap in C++
This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.
Category: Interview Questions
Understanding the Pigeonhole Principle with Python
The Pigeonhole principle is a useful tool that can be applied in various scenarios. Applying this principle, one can perform data integrity checks and make statistical predictions.
Efficiently Merging Large Sorted Files
The solution involves using an external Merge sort algorithm for handling data that cannot fit into memory. We’ll use a two-pointer technique.
Order Statistics | Selection Algorithm
“Order Statistics” is a concept discussed in the book “Introduction to Algorithms”. It pertains to finding the ith order statistics of a set of n elements in linear time. ith order statistics is the ith smallest element in a set of n elements.
Web Development – Application Server & Web Server (Quick Notes)
Dynamic content refers to website content that changes based on user input or other factors. This can include things like personalised recommendations or customised display.
Reservoir Sampling
Reservoir sampling is a category of randomised algorithms for choosing a simple random sample, without replacement, of k items
Master-Slave and Multi-Master Database Replication (Quick Notes)
Database replication is usually done to achieve HA (High Availability) and load-sharing purposes. A single member of group is designated as master for a given piece of data and is the only node allowed to modify data.
Mixins | Diamond Problem
Mixins help avoid problem caused by multiple inheritance namely, Diamond Problem. Diamond problem is the reason why Java doesn’t support multiple inheritance.
Restaurant Rating Solution (Heap) | CodeChef [Medium]
Chef has opened up a new restaurant. He picks out the positive reviews and posts it on the website of the restaurant. A review is considered to be positive if it is among the top one-third of the total reviews when they are sorted by their rating.
Generate Pythagorean Triples
Given an integer limit, generate all Pythagorean Triples with values smaller than limit.