Company: Z Scaler
Difficulty: medium
Drop-off Centers An e-commerce company wants to contract with local businesses to use their stores as pick-up and drop-off centers for their packages. To reduce expenses, they want to ensure that their drop-off centers are a minimum distance apart from each other. A city has many potential drop-off centers to choose from, represented as nodes on a weighted, undirected graph. The edges on this graph denote roads that connect pdcs, with weights representing the lengths of the roads. Determine how many unique subsets of these companies can be contracted that will satisfy that requirement. Note that locations owned by the same local business must also meet the minimum distance requirement. If they make an agreement with a company, they will have a drop-off center in every location that the company owns. Input Format The function findCount has the following parameters: int graph_nodes : number of nodes in the graph (potential drop-off centers in the city) List<Integer> graph_from[] :