Algorithm Interview Report
- 0of 0 votes
AnswerA tea vendor group starts at a railway
- Ramesh September 29, 2012 in United States
station. Each train arrives at different intervals
of time and each stays in station for certain
interval of time in which the tea vendor
can service the passengers. Each tea vendor
can provide service only for a specified interval
of time. Find an efficient algorithm which requires
minimum number of tea vendors so as
to cover the services of all the trains.| Report Duplicate | Flag | PURGE
Algorithm - 0of 0 votes
AnswersWhile travelling in a cycle race, there are
- Ramesh September 29, 2012 in United States
several pit stops. A cyclist can travel upto 50
km without stopping at any pit stop, where he
can have a health drink and refill his energy.
Given a start point ’t’ and let ’k’ be the distance
needed to be travelled by the cyclist, find
an efficient algorithm to reach the destination
’d’ so as to have minimum pit stops and prove
your algorithm is the most optimal one.| Report Duplicate | Flag | PURGE
Algorithm