Airbnb
81 questions · 46 experiences · LeetCode (68) · 1p3a (34) · Blind (1) · Other (24)
127 entries
1/6Airbnb Senior Software Engineer TPS Interview Question
New Coding Problem at Airbnb Tech Phone Screen for SDE Role
Airbnb TPS
Airbnb onsite
AirBnb Senior Onsite
Airbnb Phone Screen | Senior SDE
Airbnb SE Question
Need Help with Airbnb interview experience
AirBnb | Software Engineer | L4 Bangalore
Airbnb | SDE2 | Bangalore | April 2022 [Reject]
Airbnb | SDE Intern | India | July 2022 [Offer]
Airbnb | Intern | India | August 2022 [Offer]
Airbnb | SDE2 | Bangalore | Reject
Airbnb | Phone| coding round 2
Airbnb | Onsite | Max Words Package
Airbnb | Phone screen | Combination Sum
Airbnb | Cover all vertices with the least number of vertices
Airbnb | Phone screen | Minimize Rounding Error to Meet Target
Airbnb | Phone screen | Paginate Listings
Airbnb | Phone screen | Lowest common territory that holds the given 2 places
Airbnb | Phone Screen | Calculate Board Score
Airbnb | Iterator over List of Lists
Airbnb | Phone Screen | Find Strings That Differ by 1 Character
Airbnb | OA 2019 | Halloween Candy
Airbnb | Phone Screen | Tag Words
Airbnb Senior Software Engineer TPS Interview Question
Question Details
Helping the Leetcode Community! For a given neighborhood and group size G, choose a subset of properties such that: - Total capacity >= Group_size - Among all such subsets, choose the one with minimum number of properties - If multiple subsets use the same number of properties, choose the one with minimum total capacity - Return the selected property IDs - If impossible, return -1 Sample Input: function(List<Property> properties, int group_size, String neighbourHood) -> return type: List<Integer> property_ids Property1 : { Id:1, Capacity: 5, NeighborHood: "downtown" } Property2 : { Id:2, Capacity: 3, NeighborHood: "downtown" } Property3 : { Id:3, Capacity: 1, NeighborHood: "downtown" } Property4 : { Id:4, Capacity: 3, NeighborHood: "uptown" } Property5 : { Id:5, Capacity: 2, NeighborHood: "uptown" }