Skip to content

Latest commit

 

History

History
10 lines (7 loc) · 273 Bytes

File metadata and controls

10 lines (7 loc) · 273 Bytes

Find Edges

Challenge

Take in a graph and an array of city names and determine if the trip can be made with direct flights and return true and the total price of trip.

Approach & Efficiency

Used a graph. BigO: T: N^2, S: 1

Solution