FastPrepRobot Assembly Line Conflicts

Robot Assembly Line Conflicts

Google logoGoogle● MediumFULLTIMEOA

Problem statement

Robots stand at consecutive positions along a line. The string robotMovements gives each robot's initial state: R moves right, L moves left, and S remains stationary. Every moving robot has the same speed.

When two moving robots meet head-on, both stop and contribute 2 conflict events. When one moving robot reaches a stationary robot, it stops and contributes 1 conflict event. A robot stopped by an earlier collision becomes a stationary obstacle for later robots.

The problem statement continues
Pro

Examples

Example 1

robotMovements = "RLRSLL"return = 5

The head-on collision contributes 2. The right-moving robot that reaches S contributes 1, and the final two left-moving robots contribute 1 each.

Original screenshot from the interview report
Pro
FastPrep Pro
Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 1 more worked example, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week
See Google hiring insights
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

  • Full problem statement and constraints
  • 1 more worked example, explained
  • Guided hints and editorial
  • Run your code on real test cases
$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week