Amazon Interview Report
- 0of 0 votes
There are buses taking various routes and each route has some stops. Given a matrix of stops and distances (distance between two stops for connected stops), find all cluster of stops of any size with all stops in a cluster fully connected and are at a distance not greater than D.- emptycup July 06, 2015 in India
Assume that the routes are bi-directional.
| Report Duplicate | Flag | PURGE
Amazon SDE-2 Algorithm Dynamic Programming