range

Find the time period with the maximum number of overlapping intervals

Posted on January 22, 2014 (Last modified on August 7, 2020) | 2 minutes | Kinshuk Chandra

Problem There is one very famous problem. I am asking the same here. There is number of elephants time span given, here time span means, year of birth to year of death. You have to calculate the period where maximum number of elephants are alive. Example : 1990 - 2013 1995 - 2000 2010 - 2020 1992 - 1999 Answer is 1995 - 1999 Solution Pseudocode Split each date range into start date and end date. [Read More]

Given an array of 100,000 pixel color values and each of which is an integer in the range (0,255). Give sorting algorithm.

Posted on January 22, 2014 (Last modified on August 7, 2020) | 1 minutes | Kinshuk Chandra

We should use counting sort.

There are only 256 key value, so aux array will have only 256 values, and in O(n) time and 2 passes we will be able to sort in efficient way.

kodeknight range counting-sort sorting integer-sort count