Airbnb Intern OA, Donut Challenge: 22 Experiences (Part 2 of 7)
- Company
- Airbnb
- Level
- Internship
- Stages
- OA
Airbnb SWE intern OA reports from late 2022 and October 2021: one coding task in 60 minutes, drawn each season from a short list of repeat problems.
At a glance
- Process: A single OA with one coding task. 12 of these 22 reports gave the length as 60 minutes, and 7 named HackerRank or showed its screens. One October 2022 report had two questions instead (H08).
- Asked in these reports: Late 2022 brought two grid tasks, Minimum Moves (H01, H02, H05) and Server Selection (H03, H06, H07). The October 2021 wave rotated three: Donut Challenge (6 reports), Module Rebuild Costs (4) and Fraction to Recurring Decimal (3).
- Difficulty: Five of the eight 2022 reports rated the OA hard or hardest (H01, H02, H04, H06, H07). In October 2021, 12 of 14 called it average; H13 said easy and H20 said hard.
- Practise first: Donut Challenge, Module Rebuild Costs, Minimum Moves and Server Selection.
Coverage: 22 software engineer intern candidates who reported only the OA. Eight are from October to December 2022 (H01–H08) and 14 from 13 to 23 October 2021 (H09–H22). Most were master's students; three were PhD and two bachelor's students. Only H08 gave a location (United States). Two passed (H12, H17), two were waitlisted (H06, H13), four did not move on (H07, H08, H14, H16), and the rest did not say.
In this series
- Part 1: Airbnb SWE Intern OA / Interviews: overview, the five 2025 reports and what to practise.
- Part 2 (current): OA-only reports from late 2022 and October 2021. Minimum Moves, Server Selection, Donut Challenge, module costs and the decimal task.
- Part 3: Airbnb Intern OA, Halloween Candy: OA-only reports from 2019 to 2021, mostly fall 2019. The candy-eating rate task, module costs, the decimal task and the XML validator.
- Part 4: Airbnb Intern OA, Diplomacy Game: older OA-only reports, 2016 to 2019. The Diplomacy battle simulation and host-crowding pagination.
- Part 5: Airbnb Intern OA and Onsite Rounds: OA reports with the rounds that followed, 2018 to 2022, including two 2022 offer loops.
- Part 6: Airbnb Intern OA and Phone Screens: more OA-then-interview timelines from 2017 and 2018.
- Part 7: Airbnb Intern Phone Interviews: interview reports with no OA mentioned. Pour Water, Alien Dictionary, the file system and flight routes.
What came up
Each season reused a small set of tasks, so the same problem name shows up again and again within a few weeks. Counts are out of the 22 reports in this part; H08 and H14 named no task.
| Task | Reports | Last seen |
|---|---|---|
| Donut Challenge (LeetCode 875 style) | 6 of 22 | Oct 2021 (report date) |
| Module Rebuild Costs | 4 of 22 | Oct 2021 (report date) |
| Minimum Moves (plus H04, likely) | 3 of 22 | Dec 2022 (report date) |
| Server Selection | 3 of 22 | Dec 2022 (report date) |
| Fraction to Recurring Decimal (LeetCode 166) | 3 of 22 | Oct 2021 (report date) |
History (before 2023): 22 OA-only reports
H01: Minimum Moves, a few tests short
Report date: Dec 2022 · Role: SWE intern (master's student)
- Applied online. The OA was one problem in 60 minutes: Minimum Moves, the grid-jumping task spelled out under H02.
- A few test cases failed. The candidate rated the OA hard.
H02: Minimum Moves, jumping up to k cells
Report date: Dec 2022 · Role: SWE intern (master's student)
- Applied online, then a HackerRank OA with one problem in 60 minutes: Minimum Moves.
- The task: an n × m grid has some blocked cells. Start in the top-left corner and reach the bottom-right one. Each move goes up, down, left or right by anywhere from 1 to k cells, and it cannot pass through a blocked cell. Return the fewest moves, or -1 if the corner can't be reached.
- The candidate used a breadth-first search (BFS) that advanced one cell per step, and some cases failed. A fix suggested to them afterwards: when sliding in one direction, stop at a blocked cell or at a cell already reached in fewer moves.
- Rated hard.
H03: Server Selection with a slow DP
Report date: Dec 2022 · Role: SWE intern (master's student)
- Applied online. The task was Server Selection; H07 has the statement.
- A dynamic programming (DP) solution passed about half the tests, most likely by running out of time. The faster idea suggested afterwards was a binary search on the answer, close to LeetCode 1011, with one pass over the grid for each guess.
- Rated average.
H04: An unnamed maze task, likely Minimum Moves
Report date: Nov 2022 · Role: SWE intern (master's student)
- Applied online. No statement, only a note that the task resembled a well-known contest maze puzzle. It is likely the same task as Minimum Moves (H02), but the report does not confirm it.
- The candidate rated the OA the hardest level and the experience negative.
H05: Minimum Moves with no camera
Report date: Nov 2022 · Role: SWE intern (bachelor's student)
- Applied online. HackerRank, one problem in 60 minutes, no camera.
- The problem was Minimum Moves, the same task as H02. In the candidate's words, the attempt effectively failed.
- Rated average.
H06: Server Selection after a referral
Report date: Nov 2022 · Role: SWE intern (PhD student) · Result: Waitlisted
- Came in through a referral. The task was Server Selection, described under H07.
- The candidate never found a good approach, rated the OA hard and called the experience negative.
H07: Server Selection, full statement
Report date: Nov 2022 · Role: SWE intern (PhD student) · Result: Did not pass
- Referral, then one problem in 60 minutes: Server Selection.
- The task: servers sit in an n × m grid with n ≥ m, and
vulnerability[i][j]scores each one. Choose exactly m − 1 rows. For each column, take the largest score among the chosen rows. The network's vulnerability is the smallest of those column values. Return the largest network vulnerability you can reach. - No approach given. Rated hard.
H08: Two HackerRank questions, stopped by headcount
Interview date: Oct 2022 · Role: Software Engineer (Internship) · Location: United States · Result: No offer
- A HackerRank OA with two questions the candidate rated medium to hard. Neither was described.
- The candidate was not moved forward, and the reason given was headcount.
H09: Donut Challenge
Report date: Oct 2021 · Role: SWE intern (master's student)
- Referral. The task screens looked like HackerRank. The problem was the Donut Challenge.
- The task: there are several boxes of donuts and a limit in minutes. Each minute you pick one box and eat up to d donuts from it. Find the smallest d that empties every box in time. It follows the LeetCode 875 (Koko Eating Bananas) pattern.
- Rated average.
H10: Donut Challenge in about 15 minutes
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online. Same task as H09, the Donut Challenge.
- A binary search solution took about 15 minutes to write and passed. Rated average.
H11: Just a LeetCode number, 875
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online. The candidate named only LeetCode 875, which matches the Donut Challenge others got in this wave (H09).
- Rated average.
H12: Fraction to Recurring Decimal, passed
Report date: Oct 2021 · Role: SWE intern (master's student) · Result: Passed the OA
- Referral, then one problem in 60 minutes: Fraction to Recurring Decimal (LeetCode 166). Given a numerator and a denominator, return the decimal as a string, with any repeating part in parentheses, so 2/3 becomes "0.(6)".
- Passed, rated average.
H13: Donut Challenge, binary search, waitlisted
Report date: Oct 2021 · Role: SWE intern (master's student) · Result: Waitlisted
- Applied online. HackerRank, 60 minutes, one algorithm problem with a C++ function signature: the Donut Challenge (H09).
- The approach: binary search on d from 1 to the largest box. A value of d works when the minutes needed (each box divided by d, rounded up, then added together) fit in the limit.
- The candidate called it easy and ended up on the waitlist.
H14: One LeetCode problem, done in 10 minutes
Report date: Oct 2021 · Role: SWE intern (master's student) · Result: Did not pass
- Applied online. One problem that the candidate called a LeetCode original, finished in about 10 minutes. It was never named.
- Every test passed, and a rejection followed anyway. Rated average.
H15: Application Build Cost, sorted by name
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online. The candidate called the task Application Build Cost. It is Module Rebuild Costs, with its mechanics under H21.
- What this report adds: the input is a list of strings, and the output is a list of strings sorted by module name, not by cost.
H16: LeetCode 166, rejected the next day
Report date: Oct 2021 · Role: SWE intern (master's student) · Result: Did not pass
- Applied online and got the OA about an hour later. One problem in 60 minutes: LeetCode 166, Fraction to Recurring Decimal (see H12).
- No approach given. The rejection came the day after. Rated average.
H17: Donut Challenge, called LeetCode 875 itself
Report date: Oct 2021 · Role: SWE intern (master's student) · Result: Passed the OA
- Referral. HackerRank, one problem in 60 minutes: the Donut Challenge (H09). The candidate said it was LeetCode 875 unchanged.
- Passed, rated average.
H18: A graph task, told only through the approach
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online, one problem in 60 minutes.
- The candidate described only the method: reverse the directed graph, then run a depth-first search (DFS) from each node and count the nodes below it. That most likely matches Module Rebuild Costs (H21). Rated average.
H19: LeetCode 166 again
Report date: Oct 2021 · Role: SWE intern (PhD student)
- Applied online, one problem in 60 minutes: LeetCode 166, Fraction to Recurring Decimal (H12).
- No approach given. Rated average.
H20: Donut Challenge, where brute force got through
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online. One algorithm problem in 60 minutes: the Donut Challenge (H09).
- A brute-force solution passed both test cases, and there were only two. Binary search on d, the LeetCode 875 method, was suggested to the candidate afterwards.
- Rated hard.
H21: Application Build Cost, with an example
Report date: Oct 2021 · Role: SWE intern (master's student)
- Applied online. The input came in on standard input.
- The task, Module Rebuild Costs: modules depend on one another. Changing a module means rebuilding it and every module that depends on it, directly or through others, and its cost is how many modules get rebuilt. Each input line lists a module first, then the modules linked under it.
- The example used modules R, H, G, E and I. The candidate's answers were R = 1 and G = 3.
- They built a dictionary-based tree. When BFS was suggested to them afterwards, they agreed it fits, and they warned that a module with two parents must be counted only once. No interview invite came, so they expect a rejection.
H22: The module graph, from a campus career fair
Report date: Oct 2021 · Role: SWE intern (bachelor's student)
- Came through a campus career fair. HackerRank, 60 minutes, no webcam.
- The same graph task as H18, Module Rebuild Costs. The candidate built the graph with a map and used DFS, then ran out of time while debugging it, and expects a rejection.
- Rated average, experience negative.
Patterns across the reports
- One task, one hour. All but one report that gave a problem count had a single problem, and twelve gave 60 minutes (H01, H02, H05, H07, H12, H13, H16–H20, H22). The exception is H08, with two HackerRank questions in October 2022.
- The task pool was small each season. From November to December 2022, the named tasks were only Minimum Moves (H01, H02, H05, likely H04) and Server Selection (H03, H06, H07). In the October 2021 wave, all 13 reports with an identifiable task had one of three: Donut Challenge, Module Rebuild Costs or the decimal task.
- Passing every test did not guarantee a next step. H14 passed all tests and was rejected the same way H24 in Part 3 was in 2021.
Keep practicing
- Donut Challenge: the LeetCode 875 style rate task from H09–H11, H13, H17 and H20.
- Module Rebuild Costs: the dependency-graph task from H15, H18, H21 and H22.
- Minimum Moves: the grid with jumps of up to k cells, from H01, H02 and H05.
- Server Selection: the m − 1 rows task from H03, H06 and H07.
- Fraction to Recurring Decimal: LeetCode 166, from H12, H16 and H19.
- Airbnb coding question bank: every Airbnb algorithm problem on FastPrep. Sign-in needed.
- Airbnb interview guide: the company overview page.
- Airbnb hiring insights: hiring data for Airbnb.
- Experience feed: roundups for other companies.
In this series
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.