Find valid split-stay listing combinations

Q: Find valid split-stay listing combinations

This is a Coding & Algorithms interview question from Airbnb for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are building a feature that suggests a split stay: a guest stays in one home for the first part of a trip, then switches to a second home for the remainder.

You are given:

A map availability from listing name (e.g., "A", "B") to a list of available day numbers (integers).
A requested date range [startDay, endDay] inclusive.

Return all valid split-stay options:

Single-listing stay : any listing that is available for every day in [startDay, endDay] .
Two-listing split stay : any ordered pair (L1, L2) for which there exists a split day k with startDay <= k < endDay such that:
- L1 is available for every day in [startDay, k] , and
- L2 is available for every day in [k+1, endDay] .

Notes / clarifications:

Availability is per-day; treat it as a set (duplicates don’t matter).
A listing may appear in at most one position within a split option (i.e., L1 != L2 ).
Output can be in any order; avoid duplicates.

Example:

A = [1,2,3,6,7,10,11]
B = [3,4,5,6,8,9,10,13]
C = [7,8,9,10,11]
Query range: [3, 11]

Determine which single listings and/or two-listing split stays satisfy the rules above.

Find valid split-stay listing combinations

Comments (0)