khatibb / codechallenge

An attempt to solve a challenge (given below)

The challenge

Given the following data points, provide a JavaScript solution producing the related data tree.
Both of them are below.

Required features

The provided solution should mainly focus on efficiency.

Constraints

The resulting data tree must be identical to the one provided.

The Algorithm in english

1- sorted the data so that the shortest tier is on top, if two tiers are the same length then short by the tier value, if two tiers are identical then sort by start, this isn't mandatory but it makes the next step easier. then mapped all elements and added an empty children array to them

2- looped through the data, for each element sent it and the initial tree array to the function, that loops the array, looks for elements that have similar tier to our element, if not found just push it to the array, if found go into that element's children and do the function again (recursive function), if the element's tier is equal to the parent tier then don't go into its children.

3- finally went through the tree recursively and sorted it to match the example.