You are given a destination point target on a one lane road. There are n cars, where car i starts at position position[i] and moves toward target at constant speed speed[i].

A car cannot pass another car. If a faster car catches up to a slower car ahead of it, the faster car must slow down and they continue together at the slower car’s speed. Such a group of one or more cars traveling together is called a fleet.

Return the number of distinct car fleets that will arrive at target.

Note: A fleet may form exactly at target.

Constraints:

• n == position.length == speed.length

• $1 \leq$ n $\leq 10^5$

• $0 <$ target $\leq 10^6$

• $0 \leq$ position[i] $<$ target

• All values in position are unique

• $0 <$ speed[i] $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.