Home Roadmap Courses Problems Dashboard Pricing

Home Roadmap Courses Problems Dashboard Pricing

Loading editor…

Problem 53

Car Fleet

MediumStack

n cars travel toward target. Car i starts at position[i] with speed speed[i]. Cars cannot pass; they form a fleet and travel at the slower speed. Return how many fleets arrive.

Examples

Example 1

Input: target = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]

Output: 3

Constraints

n == position.length == speed.length1 ≤ n ≤ 10⁵

Target ComplexityNot required

O(n) Time · O(n) Space

Companies (3)

GoogleAmazonUber

Node 22.08.0

Loading editor…

Test casesRun to compare output

Inputtarget = 12, position = [10,8,0,5,3], speed = [2,4,1,1,3]

Expected3

Output—