Suppose we have some input data describing a graph of relationships between parents and children over multiple generations. The data is formatted as a list of (parent, child) pairs, where each individual is assigned a unique integer identifier.
In this diagram, 3 is a child of 1 and 2, and 5 is a child of 4:
1 2 4
\ / / | \
3 5 8 9
\ / \ \
6 7 11
Example input:
parentChildPairs = [
[1, 3], [2, 3], [3, 6], [5, 6],
[5, 7], [4, 5], [4, 8], [4, 9], [9, 11]
]
npm install
npm run test
Write a function that takes this data as input and returns two collections: one containing all individuals with zero known parents, and one containing all individuals with exactly one known parent.
Example output:
[
[1, 2, 4], // Individuals with zero parents
[5, 7, 8, 9, 11] // Individuals with exactly one parent
]
You must "Fork" this project, solve the problem and create a Pull Request to this repository.
If someone wants to add or improve something, I invite them to collaborate directly in this repository: challenge-javascript-11
challenge-javascript-11 is released under the MIT license.