Step through the algorithm visually — use Play or the step buttons (inspired by AlgoMaster / visualgo).
Capgemini interview context: Car Fleet is a Medium Stack problem — Monotonic stack or bracket matching — watch for O(n) single-pass solutions.
Use the animation above to step through each move before writing code.
Pattern: Stack
Read from stdin, write to stdout. Classic interview problem #853.
Car Fleet — Capgemini interview prep · Stack
Classic interview problem #853.
Input (stdin)
Line 1: n\nLine 2: target\nNext n lines: position speed
Output (stdout)
Number of car fleets
Your program must read from stdin and write the answer to stdout (no extra debug text).
3 12 10 8 70 2 4 60 17 9 10
2
| Test | Status | Details |
|---|
Ready — edit the code above and click Run or Submit.
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
class Program
{
static int[] Ria(string line = null)
{
line ??= Console.ReadLine();
if (string.IsNullOrWhiteSpace(line)) return Array.Empty<int>();
return line.Trim().Split(new[] { ' ', ',', '\t' }, StringSplitOptions.RemoveEmptyEntries)
.Select(int.Parse).ToArray();
}
static string[] Rsa()
{
int n = int.Parse(Console.ReadLine());
var arr = new string[n];
for (int i = 0; i < n; i++) arr[i] = Console.ReadLine();
return arr;
}
static void W(params object[] parts) => Console.WriteLine(string.Join(" ", parts));
static void Wb(bool v) => Console.WriteLine(v ? "true" : "false");
static void Wi(int v) => Console.WriteLine(v);
static void Ws(string v) => Console.WriteLine(v);
static void Main()
{
int n = int.Parse(Console.ReadLine());
int target = int.Parse(Console.ReadLine());
var cars = new List<(double pos, double speed)>();
for (int i = 0; i < n; i++) {
var p = Ria();
cars.Add((p[0], p[1]));
}
cars.Sort((a, b) => b.pos.CompareTo(a.pos));
int fleets = 0;
double maxTime = 0;
foreach (var (pos, speed) in cars) {
double t = (target - pos) / speed;
if (t > maxTime) { fleets++; maxTime = t; }
}
Wi(fleets);
}
}Try solving on your own first, then reveal the official answer.