Problem · Graph
Find Minimum City Hops
● Medium
AmazonFULLTIMEOA
See Amazon hiring insightsAmazonFULLTIMEOAProblem statement
You are given an array of cities named cities. Each city is represented by a three-character lowercase string.
Two cities are directly connected when their strings differ in exactly one character position.
The problem statement continues
ProExamples
Example 1
cities = ["abc","abd","acd","xyz"]startCity = "abc"endCity = "acd"return = 2One shortest route is abc to abd to acd. Each hop changes exactly one character, so the route uses 2 hops.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, 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