Practice Car Fleet
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
There are n cars at given miles away from the starting mile 0, traveling to reach the mile target. You are given two integer arrays position and speed, both of length n, where position[i] is the starting mile of the ith car and speed[i] is the speed of the ith car in miles per hour. A car cannot pass another car, but it can catch up and then travel next to it at the speed of the slower car. A car fleet is a car or cars driving next to each other. The speed of the car fleet is the minimum speed of any car in the fleet. If a car catches up to a car fleet at the mile target, it will still be considered as part of the car fleet. Return the number of car fleets that will arrive at the destination.
Source: Car Fleet on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]
3
# Example 2
target = 10, position = [3], speed = [3]
1
# Example 3
target = 100, position = [0,2,4], speed = [4,2,1]
1
Constraints
Related LeetCode Problems
Practice more problems similar to Car Fleet.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.