Interview Questions Archives

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.

Algorithms, Interview Questions, Mathematics

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.

Interview Questions, Networking, Web Development

Custom Randomize | Generate Integers with Equal Probability

Given a function foo(), that returns an integer between 1 and 5 with equal probability. Write a function using foo() that returns an integer between 1 and 7.

Interview Questions, Mathematics

Reservoir Sampling

Reservoir sampling is a category of randomised algorithms for choosing a simple random sample, without replacement, of k items

Algorithms, Interview Questions, Mathematics

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.

Databases, Interview Questions

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.

Interview Questions, Java

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.

Competitive Programming, Heaps, Interview Questions

Detect Loop in a Linked List | And Remove Loop

Given the head pointer of a linked list, check if there’s a loop in the linked list. Proof of Floyd’s Cycle-Finding Algorithm.

Interview Questions, Linked Lists

Minimum adjacent swaps required to sort Binary Array in O(n) | Amazon Interview Question

Given an array consisting of only 1s and 0s, sort this binary array such that all 0s are on the left and all 1s are on the right.

Arrays, Greedy approach, Interview Questions

Stock Buy Sell Maximum Profit Solution

The cost of a stock on each day is given in an array. Each day, you can either buy one share, sell any number of shares that you own, or not make any transaction at all.

Competitive Programming, Interview Questions