Pre-requisites: Basic mathematics, Pigeon hole principle
Given N candidates and M interviewers, each of whom can interview one candidate and takes one hour to interview each candidate, the task is to find minimum possible hours required to complete all the interviews.
The question is based on simple Pigeon Hole Principle.
There are N candidates and M interviewers. If you understand the Pigeon hole principle, consider candidates to to be pigeons and interviewers to be holes.
Using Pigeon hole principle the output comes out to be (M/N)+1.
Problem setter’s solution: SOLUTION