FastPrep
Problem · Array

Arrange Packages With Compatible Adjacent Weights

● MediumAmazon logoAmazonFULLTIMEPHONE SCREEN
See Amazon hiring insights

Problem statement

You are given an array weights, where every package weight is an integer from 0 through 9.

Determine whether all packages can be rearranged so that the sum of every pair of adjacent weights is strictly less than 10.

The problem statement continues
Pro

Examples

Example 1

weights = [9,0,8,1,7]return = true

One valid order is [9,0,8,1,7]. Its adjacent sums are 9, 8, 9, and 8.

FastPrep Pro
Reported in 1 Amazon 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
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week
CodePython 3
Run and Submit unlock with Pro
FastPrep Pro
Reported in 1 Amazon 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
  • 2 more worked examples, explained
  • Guided hints and editorial
  • Run your code on real test cases
$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week