FastPrepFrequently Bought Together
Problems/Frequently Bought Together

Frequently Bought Together

Amazon logoAmazon● MediumINTERNOA

Updated Sep 2026

QuestionFunctionExamples

Problem statement

Source note: 2026-06-29 — The original screenshot did not include a separate formatted output block. FastPrep used the visible tie-break result {B07,B08} and formatted it as ["B07", "B08"] for this example. This should be revisited if the original output format becomes available.

Amazon's Retail Analytics team wants to discover which pairs of items are most often bought together so they can create Frequently Bought Together bundles.

During a short observation window, each customer order is recorded as a space-separated list of SKU strings, for example "B07 B08 B09". Within a single order, the same SKU may repeat, but repeats count only once toward a bundle.

Your task is to find the pair of distinct SKUs that appears in the highest number of orders. If several pairs tie for first place, return the lexicographically smallest pair, comparing the first SKU and then the second SKU.

Function

findFrequentBundlePair(orders: String[]) → String[]

Examples

Example 1

orders = ["B07 B08 B09", "B07 B08", "B08 B09"]return = ["B07", "B08"]

Order-level pairs:

  1. {B07, B08}, {B07, B09}, {B08, B09}
  2. {B07, B08}
  3. {B08, B09}

The global counts are {B07, B08} -> 2, {B07, B09} -> 1, and {B08, B09} -> 2. The highest count is tied between {B07, B08} and {B08, B09}, so the lexicographic tie-break gives {B07, B08}.

More Amazon Online Assessment questions

  • Get Smallest Base SegmentOA · Seen Nov 2026
  • Minimum Cost of Left and Right PropagationOA · Seen Nov 2026
  • Minimum Grid InconvenienceOA · Seen Nov 2026
  • Maximize K-Element AND with an Increment BudgetOA · Seen Nov 2026
  • Maximize Shipment Order by Sorting One WindowOA · Seen Nov 2026
  • Maximum Equal-Bit Pairs in a SubsequenceOA · Seen Nov 2026
  • First Non-Repeating CharacterOA · ONSITE INTERVIEW · Seen Nov 2026
  • Two SumOA · PHONE SCREEN · Seen Nov 2026
  • Minimum Merge ConflictsOA · Seen Nov 2026
  • Shopping Cart BillingOA · Seen Nov 2026

Similar questions at other companies

  • Aggregate Paginated Project Run RecordsReplit · OA
  • Count User Mentions in Chat MessagesRamp · OARamp interview questions
  • Word Frequency Counts in Alphabetical OrderAbridge · OAAbridge interview questions
  • Group AnagramsWorkday · PHONE SCREEN
  • Group AnagramsMicrosoft · ONSITE INTERVIEWMicrosoft interview questions
  • Group AnagramsEPAM · PHONE SCREENEPAM interview questions
  • Find Duplicate Element PairsGoogle · ONSITE INTERVIEWGoogle interview questions
  • Find Duplicate File GroupsAnthropic · PHONE SCREENAnthropic interview questions
  • Insert an Employee into an Organization HierarchyWaymo · PHONE SCREENWaymo interview questions
  • Deep Merge with a Conflict ResolverAutodesk · ONSITE INTERVIEWAutodesk interview questions

Amazon interview experiences

  • Amazon SWE OA with AI Coding: 1 Experience
  • Amazon SWE Intern Phone Screen Interview Experience: 1 Experience
  • Amazon New Grad SDE I OA and Virtual Onsite: 1 Experience
  • Amazon BIE Intern SQL and Interview Questions: 17 Experiences
  • Amazon Experienced SWE AI-Assisted Debugging OA: 1 Experience
  • Amazon SDE II (L5) Interview Questions: 5 Experiences
See Amazon hiring insights
Saved
class Solution {
    public String[] findFrequentBundlePair(String[] orders) {
      // write your code here
    }

}
Checking account…