Number of Possible Sets of Closing Branches at Atlassian
Hard50.6% acceptance
This problem has 62.5% frequency at Atlassian.
Problem Description
There is a company with `n` branches across the country, some of which are connected by roads. Initially, all branches are reachable from each other by traveling some roads. The company has realized that they are spending an excessive amount of time traveling between their branches. As a result, th...
Read full problem and hintsTopics
Also asked at 2 companies
More Atlassian Questions
Stock Price FluctuationMediumMinimum Cost to Convert String IMediumMinimum Cost to Convert String IIHardMinimum Time to Visit a Cell In a GridHardMaximum Square Area by Removing Fences From a FieldMedium
View all Atlassian questions