Practice Count Ways to Build Rooms in an Ant Colony
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Count Ways to Build Rooms in an Ant Colony
Problem Statement
You are an ant tasked with adding n new rooms numbered 0 to n-1 to your colony. You are given the expansion plan as a 0-indexed integer array of length n, prevRoom, where prevRoom[i] indicates that you must build room prevRoom[i] before building room i, and these two rooms must be connected directly. Room 0 is already built, so prevRoom[0] = -1. The expansion plan is given such that once all the rooms are built, every room will be reachable from room 0. You can only build one room at a time, and you can travel freely between rooms you have already built only if they are connected. You can choose to build any room as long as its previous room is already built. Return the number of different orders you can build all the rooms in. Since the answer may be large, return it modulo 10^9 + 7.
Source: Count Ways to Build Rooms in an Ant Colony on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
prevRoom = [-1,0,1]
1
# Example 2
prevRoom = [-1,0,0,1,2]
6
Constraints
Related LeetCode Problems
Practice more problems similar to Count Ways to Build Rooms in an Ant Colony.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.