Leetcode 853. Car Fleet

Given start positions and speeds of cars heading to a target where cars cannot pass but can catch up, count how many groups ("fleets") arrive together. Core idea: sort cars by descending position, compute each car's time-to-target, and form a new fleet whenever a car's time is greater than the smallest (slowest) arrival time seen ahead.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 853. Car Fleet

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact