Airbnb Intern OA, Halloween Candy: 22 Experiences (Part 3 of 7)

Shared by janebeingjane ·
Company
Airbnb
Level
Internship
Stages
OA

Airbnb SWE intern OA reports from fall 2019 and 2021: one task per candidate, most often the Halloween candy rate problem, module costs or an XML check.

At a glance

  • Process: One coding task per candidate. In fall 2019 the OA email carried a version label, 2019.3 or 2019.4, and the link stayed open for several days: one week in H31, four days in H34. H23 and H39 had one question in one hour.
  • Asked in these reports: The Halloween candy rate task led with 9 reports (H26, H27, H33–H35, H37, H40, H43, H44). Module costs came up in 5, and the decimal task and the XML validator in 4 each. These counts include H37, which listed a whole four-task set. The two 2021 reports gave only topics: binary search (H23, H24).
  • Difficulty: H39 called its tree question very hard, about LeetCode medium to hard. Module costs tripped people on the input: H41 warned the sample is easy to misread, and H42 found the input full of small details and did not pass every test.
  • Practise first: Minimum Eating Speed, Module Rebuild Costs, Fraction to Recurring Decimal and Simplified XML Validator.

Coverage: 22 software engineer intern candidates who reported only the OA. Two are from fall 2021 (London, H23; United States, H24). The other 20 date from 19 September to 26 October 2019 (H25–H44); one of them gave a location (United States, H39). Of the 19 who gave a degree, 13 were master's and 6 bachelor's students. Five passed or were invited onward (H26, H27, H31, H32, H41), one was waitlisted (H36), four were rejected (H23, H24, H39, H42), and the rest did not say.

In this series

What came up

Fall 2019 drew from one small set of four tasks, and the candy problem was the one people met most. Counts are out of the 22 reports in this part, and H37's four-task listing adds one to each of four rows.

Task or topic Reports Last seen
Minimum Eating Speed (Halloween candy, LeetCode 875 style) 9 of 22 Oct 2019 (report date)
Module Rebuild Costs 5 of 22 Oct 2019 (report date)
Fraction to Recurring Decimal (LeetCode 166) 4 of 22 Oct 2019 (report date)
Simplified XML Validator 4 of 22 Oct 2019 (report date)
Binary search, no task named 2 of 22 Oct 2021
A hard tree question 1 of 22 Oct 2019

History (before 2023): 22 OA-only reports

H23: London, one HackerRank question in an hour

Interview date: Oct 2021 · Role: Software Engineer (Internship) · Location: London, United Kingdom · Result: No offer

  1. A take-home HackerRank OA: one algorithm question in one hour. The invite came with a link for practising on earlier tests.
  2. The question needed an array sort followed by a binary search. No name or statement was given.

H24: Every test passed, still rejected

Interview date: Sep 2021 · Role: Software Engineer (Internship) · Location: United States · Result: Rejected after the OA

  1. A recruiter sent the OA link. The one question rested on binary search logic.
  2. The candidate's optimized solution passed every test case, and the rejection came anyway.

H25: Cost of modules after a referral

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Referred around 13 September; version 2019.3. The task was "cost of modules", which is Module Rebuild Costs: when one module changes, count how many modules must be rebuilt, the module itself plus everything that depends on it, directly or not. Part 2 (H21) has a worked example.
  2. No approach or result given.

H26: Halloween candy, phone screens the same day

Report date: Oct 2019 · Role: SWE intern (master's student) · Result: Invited to phone screens

  1. The task was the Halloween candy story, Minimum Eating Speed. You know how many candies are in each pile and how many hours there are. Each hour you eat from one pile, up to a fixed rate. Find the smallest rate that finishes everything in time. It fits LeetCode 875.
  2. Later that same day came an invite to two back-to-back phone screens.

H27: LeetCode 875 by number, passed

Report date: Oct 2019 · Role: SWE intern (bachelor's student) · Result: Passed the OA

  1. Referral; version 2019.3. The candidate wrote only "LeetCode 875", most likely the Halloween candy task others met that fall, Minimum Eating Speed (H26).
  2. The day after the OA, word came that they were moving to the next step.

H28: LeetCode 166, number only

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Referral; version 2019.3. The candidate named only LeetCode 166, Fraction to Recurring Decimal: turn a numerator and a denominator into a decimal string and wrap the repeating part in parentheses, so 1/3 becomes "0.(3)".

H29: "Still the old problem"

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Applied online; version 2019.3. LeetCode 166 again, Fraction to Recurring Decimal (H28), which the candidate called the same old problem.

H30: XML Validator, rewritten after hidden tests

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Applied online; OA version 2019.4.
  2. The task, Simplified XML Validator, is a simpler cousin of LeetCode 591 (Tag Validator): write valid(str) and decide whether a string is valid in a cut-down XML format. The candidate recalled the input and output format and nine test strings.
  3. The first try, built on a stack, failed two hidden tests. The rewrite split the job in two: one function checks that the text inside each <...> is a valid tag, and the other pairs opening and closing tags with a stack. The final result was not stated.

H31: XML Validator, then failed phone screens

Report date: Oct 2019 · Role: SWE intern (master's student) · Result: Passed the OA, then did not pass the phone screens

  1. Met Airbnb at a campus career fair. The "Coding Challenge - New 2019.4" link arrived on 8 October with a week to finish, and the candidate took it on 14 October.
  2. The rules this candidate gave for the Simplified XML Validator: the input is one string. Plain text must not contain < or >. Tags look like <a> and </a>; they may nest but must close in the right order. The output names the error type: a missing pair, a mismatched pair or a parse failure (exact strings not given).
  3. A move-forward notice came the next day. The candidate later failed the back-to-back phone screens.

H32: XML Validator with a stack

Report date: Oct 2019 · Role: SWE intern (master's student) · Result: Passed the OA (per the referrer)

  1. Referral; OA version 2019.04.
  2. The task was the Simplified XML Validator (H31), solved with a stack.
  3. The referrer said the candidate was moving to the next round, though no HR email had arrived yet.

H33: Halloween candy, same as a friend's

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Applied online. The OA email came on 7 October, version 2019.4.
  2. The candidate and a friend both got the candy problem, Minimum Eating Speed (H26). A follow-up arrived the next day.

H34: Halloween candy, four days to finish

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Referral. The 2019.04 version arrived on 7 October with four days to complete it.
  2. The task was Halloween candy, Minimum Eating Speed (H26). No approach or result given.

H35: Candy, through an outside recruiter

Report date: Oct 2019 · Role: SWE intern (bachelor's student)

  1. Came in through an outside recruiter; version 2019.3. The task was the candy-eating problem, Minimum Eating Speed (H26), which the candidate equated with LeetCode 875 (Koko Eating Bananas).

H36: "Division" with negatives, waitlisted

Report date: Oct 2019 · Role: SWE intern (bachelor's student) · Result: Waitlisted

  1. Applied online and sat the OA on Sunday 6 October.
  2. The task, called "Division", was in the candidate's words the LeetCode problem with negative numbers included: Fraction to Recurring Decimal (H28).

H37: All four tasks of the 2019.4 set

Report date: Oct 2019 · Role: SWE intern (master's student)

  1. Referral. The candidate listed the whole 2019.4 set as four problems. They and a classmate each got one of the four; the report does not say which.
  2. The four: a candy-stealing problem (the Halloween candy task, Minimum Eating Speed, as in H26), Cost of Modules (Module Rebuild Costs), Division (Fraction to Recurring Decimal) and the XML Validator (Simplified XML Validator).

H38: Cost of modules, name only

Report date: Oct 2019 · Role: SWE intern (bachelor's student)

  1. Referral; version 2019.4. The task was "cost of modules", Module Rebuild Costs (H25). Nothing more was given.

H39: One hard tree question

Interview date: Oct 2019 · Role: Software Engineer (Internship) · Location: United States · Result: Rejected after the OA

  1. Applied online. The coding challenge came about two weeks later: one hour, one very hard tree question, not named, which the candidate put at about LeetCode medium to hard.
  2. The candidate understood that the challenge varies from person to person.

H40: Halloween candy, from a career fair

Report date: Sep 2019 · Role: SWE intern (master's student)

  1. Came through a campus career fair; version 2019.4. The task was Halloween candy, Minimum Eating Speed (H26). Name only.

H41: Cost of modules, passed, with an input warning

Report date: Sep 2019 · Role: SWE intern (bachelor's student) · Result: Passed the OA

  1. Referral; version 2019.4. The task was Cost of Modules, Module Rebuild Costs (H25).
  2. Two warnings: a module with only one dependency may not get its own line in the input, and the sample is easy to misread.

H42: Cost of modules with a topological sort

Report date: Sep 2019 · Role: SWE intern (bachelor's student) · Result: Did not pass

  1. Applied online; version 2019.3. The task was Cost of Modules, Module Rebuild Costs (H25).
  2. The candidate used the topological-order idea from LeetCode 210 (Course Schedule II). Reading the input had many small details, and not every test passed.

H43: Halloween candy, recognised on sight

Report date: Sep 2019 · Role: SWE intern (master's student)

  1. Applied online; version 2019.3. The task was Halloween candy, Minimum Eating Speed (H26).
  2. Having studied the past problem set, the candidate knew it at once and solved it with binary search. In their view, everyone on the 2019.3 version got this task. They advised finishing within about four days of getting the link.

H44: Halloween candy, with the sample

Report date: Sep 2019 · Role: SWE intern (master's student)

  1. Referred in early September; the "new 2019.3" OA email came a few days before 19 September.
  2. The Minimum Eating Speed task (H26) read from standard input. Sample: 4 piles holding 4, 9, 11 and 17 candies with 8 hours gives 6. At 6 an hour the piles take 1 + 2 + 2 + 3 = 8 hours; at 5 they would take 10.

Patterns across the reports

  1. Version labels in 2019. Seventeen of the 20 reports from 2019 gave a version: nine 2019.4 (H30–H34, H37, H38, H40, H41) and eight 2019.3 (H25, H27–H29, H35, H42–H44). Halloween candy appeared under both labels (H33, H34 and H40 on 2019.4; H27, H35, H43 and H44 on 2019.3), and so did module costs (H38 and H41 on 2019.4; H25 and H42 on 2019.3). H43 thought everyone on 2019.3 got the candy task, but H28 and H29 had the decimal task under that label.
  2. Fast answers after the OA. Four candidates heard back within a day: a phone-screen invite the same day (H26), and a next-step or follow-up note the next day (H27, H31, H33).
  3. Module costs trips people on the input. The two module reports that said more than the task name both pointed at the input: the easy-to-misread sample (H41) and many small parsing details (H42).

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAirbnb Intern OA, Diplomacy Game: 19 Experiences (Part 4 of 7)
0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.