FastPrepFactory Cost — Minimum Cost Across Stages
Problems/Factory Cost — Minimum Cost Across Stages

Factory Cost — Minimum Cost Across Stages

Stripe logoStripe● MediumFULLTIMEPHONE SCREEN

Updated Oct 2026

QuestionFunctionExamplesConstraints

Problem statement

Source note: July 24, 2026 — 🐿️ I re-audited the original source and rebuilt this practice version from the author-written interview report. It is about a 65% match to the available source. The three-part progression, factory-stage structure, production costs, distance-based transit cost, and minimum-total-cost objective come directly from the source. The original function signature, runnable input format, constraints, examples, and edge-case behavior were not shown, so FastPrep filled them in consistently without changing what the original question asks you to do.

Special thanks: 🌷 A special thank you to our lovely, amazing frenz who shared that this question appeared again on September 23, 2026! ദ്ദി ˉ͈̀꒳ˉ͈́ )✧ 🧡

You are given production stages in stages. Each stages[i] contains the factories available for stage i. A factory is represented as [position, productionCost], where position is its location on a one-dimensional line.

Interview progression

Part 1

Ignore every factory position. Choose factories to minimize the total production cost.

Part 2

There are exactly three stages. Include the transit cost of moving the product between the selected factories. Moving between positions x and y costs |x - y|.

Part 3

The number of stages can be arbitrary. Minimize the sum of all selected production costs and all transit costs between consecutive stages.

Your task

Implement Part 3. Select exactly one factory from each stage. Stages are traversed in input order, and transit is charged only between factories selected from consecutive stages. There is no inbound transit before the first stage and no outbound transit after the last stage.

Return the minimum total cost as a signed 64-bit integer.

Function

findMinimumCost(stages: int[][][]) → long

Examples

Example 1

stages = [[[0,1],[10,4]],[[0,100],[10,4]],[[0,1],[10,4]]]return = 12

Select the factory at position 10 in every stage. The production cost is 4 + 4 + 4 = 12, and both transit costs are 0. Selecting the locally cheapest factories would cost 1 + 4 + 1 + 10 + 10 = 26, so the minimum is 12.

Example 2

stages = [[[-5,3],[4,6]],[[-2,4],[4,2]],[[1,4],[4,2]],[[3,3],[4,6]]]return = 14

Select positions 4, 4, 4, 3. Their production costs total 6 + 2 + 2 + 3 = 13, and transit costs 0 + 0 + 1 = 1, for a total of 14.

Example 3

stages = [[[-7,9],[3,2]]]return = 2

There is one stage, so there is no transit cost. Choose the factory whose production cost is 2.

Constraints

  • stages.length >= 1.
  • Every stages[i] contains at least one factory.
  • Every factory is represented by exactly two signed 32-bit integers: [position, productionCost].
  • Exactly one factory must be selected from each stage.
  • The minimum total cost fits in a signed 64-bit integer.

More Stripe Phone Screen questions

  • Merchant Payout Scheduler, Part 2: Per-Merchant SchedulesPHONE SCREEN · Seen Nov 2026
  • Financial Account LedgerOA · PHONE SCREEN · Seen Nov 2026
  • Business Account KYC Verification — Parts 1–5PHONE SCREEN · Seen Nov 2026
  • Render a Task Tree from CSV RowsPHONE SCREEN · ONSITE INTERVIEW · Seen Nov 2026
  • Invoice / Payment ReconciliationPHONE SCREEN · ONSITE INTERVIEW · Seen Nov 2026
  • Linked Merchants Within Two HopsPHONE SCREEN · Seen Nov 2026
  • Portfolio Valuation, Part 1PHONE SCREEN · Seen Nov 2026
  • Account Roles With Parent-User InheritancePHONE SCREEN · Seen Nov 2026
  • Merchant Payout Scheduler, Part 3: Hold PeriodsPHONE SCREEN · Seen Nov 2026
  • Merchant Payout Scheduler, Part 1PHONE SCREEN · Seen Nov 2026

Similar questions at other companies

  • Find Robots by Blocker DistancesUber · PHONE SCREENUber interview questions
  • Path Through an O/X Grid Using Only Right and DownAmazon · PHONE SCREEN
  • Maximum Rocks on a North-or-East Grid PathGoldman Sachs · PHONE SCREENGoldman Sachs interview questions
  • Maximal SquareAirwallex · PHONE SCREENAirwallex interview questions
  • Maximal SquareSalesforce · PHONE SCREENSalesforce interview questions
  • Minimum Path SumBloomberg LP · PHONE SCREEN · ONSITE INTERVIEWBloomberg LP interview questions
  • Maximum Falling Path SumIMC Trading · PHONE SCREENIMC Trading interview questions
  • Grid Paths Around Blocked CellsAdobe · PHONE SCREENAdobe interview questions
  • Largest Diamond of Ones in a GridRippling · PHONE SCREENRippling interview questions
  • Longest Increasing Path in a MatrixNew Relic · PHONE SCREEN · ONSITE INTERVIEW

Stripe interview experiences

  • Stripe SWE Onsite over Two Days: 1 Experience
  • Stripe New Grad SWE Phone Screen and Onsite: 2 Experiences
  • Stripe AI Coding Interview, Experienced SWE: 6 Experiences
  • Stripe SWE Intern Payout Scheduler Phone Screen: 1 Experience
  • Stripe New Grad SWE Onsite and HM Round: 1 Experience
  • Stripe Experienced MLE Phone Screens: 1 Experience
All Stripe interview questionsSee Stripe hiring insights
Saved
class Solution {
    public long findMinimumCost(int[][][] stages) {
      // Write your code here.
    }
}
Checking account…