Upload Button Icon Add office photos

Airbnb

Compare button icon Compare button icon Compare

Filter interviews by

Airbnb Software Engineer Interview Questions and Answers

Updated 26 Mar 2024

Airbnb Software Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Implement an iterator to flatten 2D vector

Round 2 - One-on-one 

(1 Question)

  • Q1. Find shortest path to get all keys
  • Ans. 

    Use Dijkstra's algorithm to find the shortest path to get all keys

    • Implement Dijkstra's algorithm to find the shortest path in a graph

    • Consider the keys as nodes in the graph and the paths between keys as edges

    • Keep track of the keys collected and update the shortest path accordingly

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice algorithmic questions

Skills evaluated in this interview

Interview questions from similar companies

I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Assignment 

E-commerce

Interview Preparation Tips

Interview preparation tips for other job seekers - Work from home Jobs so I am software engineer Java

I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
  • Ans. 

    Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.

    • Iterate through the matrix and find the doors

    • Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door

    • Update the distance matrix with the minimum distances

  • Answered by AI
  • Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
  • Ans. 

    Find kth smallest element in unordered array with O(1) space

    • Use the QuickSelect algorithm to partition the array and find the kth smallest element

    • Choose a pivot element and partition the array into two subarrays

    • Recursively partition the subarray that contains the kth smallest element

    • Repeat until the pivot element is the kth smallest element

    • Time complexity: O(n) average case, O(n^2) worst case

  • Answered by AI
  • Q3. Design question
  • Q4. Find friends of friend who already are not friends with you
  • Ans. 

    To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.

    • Get your list of friends

    • For each friend, get their list of friends

    • Exclude yourself and your friends from the final list of friends of friends

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.

Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.

Round: Other Interview
Experience: This was bar-raiser round.

Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras

Skills evaluated in this interview

I appeared for an interview before Apr 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.

  • Q1. 

    Kth Largest Element Problem Statement

    Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.

    Example:

    Input:
    Array: [2,1,5,6,3,8], K ...
  • Ans. 

    Find the Kth largest element in an array of distinct positive integers.

    • Sort the array in non-increasing order

    • Return the Kth element from the sorted array

    • Handle multiple test cases

  • Answered by AI
  • Q2. 

    Orange Rotting Problem Statement

    Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:

    • Value 0: Represents an empty cell.
    • Value 1: Represents a fresh orang...
  • Ans. 

    The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.

    • Create a queue to store the rotten oranges and their time of rotting.

    • Iterate through the grid to find the initial rotten oranges and add them to the queue.

    • Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.

    • Continue until the queue is empty, ke...

  • Answered by AI
Round 2 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

This was a design round.

Interview Preparation Tips

Eligibility criteriaAbove 8 CGPAUber interview preparation:Topics to prepare for the interview - Design, Algorithms And Data Structures, Graph Theory, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Data Structures
  • Q2. Algorithms knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - Study DSA and be thorough with projects.

I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. DS Algo Questions on Trees. Leadership Principles

Interview Preparation Tips

Interview preparation tips for other job seekers - Read up on DS Algo and white paper coding and Leadership Principles

Software Engineer Interview Questions & Answers

Amazon user image Rajesh Paramanandam

posted on 24 Feb 2017

I appeared for an interview in Oct 2016.

Interview Preparation Tips

Round: Test
Experience: Aptitude was quite easy they just asked us basic questions from Math,logical reasoning and english
Tips: Just think well before u do..
Duration: 1 hour 30 minutes
Total Questions: 40

Round: Behavioural Interview
Experience: It was face to face .. the interviewee asked questions from our resume... Since I m from computer science background they asked some technical questions..

Tips: Beware filling ur resume.. they will ask every stuff that you have in resume

Round: Technical Interview
Experience: Discussion about my project that i vr done in my final year.they asked me what was my role in my project

College Name: Sri ganesh college of engineering and technology

Interview Preparation Tips

Round: Test
Experience: The first test
contained 25 objective questions encompassing the basics of Computer Science ranging from
data structures, networks and operating systems to theory of computation
Duration: 45 minutes
Total Questions: 25

Round: Test
Experience: The second test contained 3 coding questions.
Duration: 45 minutes
Total Questions: 3

Round: HR Interview
Experience: After the written test, next day I appeared for 3 interviews.
They were checking if you can write code and also if you are aware of the practical issues faced while coding. In the final round they were testing if you could abstract out a real world
problem into code.
Tips: Overall I can say that you must hope for the best and prepare for the
worst. So make sure that you are prepared on all counts. You never know what might go wrong.

Interview Questionnaire 

2 Questions

  • Q1. Data struct,algo,
  • Q2. High level data structs and algos

Interview Preparation Tips

Round: Problem Statement
Experience: coding and submission before face to face interview shortlisting
Tips: practice coding ,coding is key to success for SE

Round: Resume Shortlist
Experience: based on marks ,I was called for F2F
Tips: the ppt was to be submitted explaining the approach

Round: Technical Interview
Experience: a lot of brain storming
Tips: understands the nitty gritty of the structs and algos

Round: Technical Interview
Experience: exact code was to be written instead of pseudo code
Tips: get hold of DS,Algos

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. Boundary traversal of a tree
  • Ans. 

    Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.

    • The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.

    • For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.

    • For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.

    • For the ri...

  • Answered by AI
  • Q2. Find the nearest greater value of a given value in a BST
  • Ans. 

    Find the nearest greater value of a given value in a Binary Search Tree (BST).

    • Start from the root node and compare the given value with the current node's value.

    • If the given value is less than the current node's value, move to the left subtree.

    • If the given value is greater than the current node's value, move to the right subtree.

    • Keep track of the closest greater value encountered while traversing the tree.

    • Return the cl

  • Answered by AI
  • Q3. There is an infinite stair case and there are n rounds. in i'th round we can jump i steps at one or discard them. it is given that k'th step is broken , find the max height we can reach with out stepping o...
  • Ans. 

    Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.

    • We can start by jumping the maximum number of steps in each round until we reach the broken step.

    • After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.

    • We can continue this pattern until we reach the maximum height we can reach wit

  • Answered by AI
  • Q4. Height h was given and form a binary tree of height h and start combining bottom nodes to form a cone like structure

Interview Preparation Tips

Round: Test
Experience: there were 20 MCQ which were on ds , networks and basic coding followed by 2 coding questions.
1) print all the distinct substrings of a given string in lexicographical order
2) find the max i-j value in the given array of 0's and 1's such that there are equal number of zeros and ones, where i is the starting index and j is the ending index of the array.
Tips: make sure that you pass atleast half the test cases for both the question.
Duration: 90 minutes
Total Questions: 22

Round: Technical Interview
Experience: 1) i printed left view then leaves and right view using three level order traversals . he asked me to use one traversal only, then i told him the approach and wrote the working code.
2) told him the approach and coded it.
Tips: look at corner cases properly. the interviewers were friendly, so i felt relaxed.

Round: Technical Interview
Experience: 1) i told him a recursive O(2^n) solution, optimised it to O(n^2). he told me to optimise further. Then i finally came up with O(n) solution after 5 min and he was satisfied . i coded it. he was satisfied finally :D .
2) came up with the approach immediately and coded it. he was satisfied.
Tips: he was very particular about corner cases and he checked the code througly tested it on some cases to ensure it was working.

General Tips: be cool. interviewers were friendly. tell them what you are thinking and be clear with the question before answering to avoid wasteage of time.
Skill Tips: solve problems from codechef, spoj and codeforces. solve interview questions from geeksforgeeks and careercup.
Skills: the way you think, coding skills and knowledge on data structures.
Duration: 3
College Name: IIT Roorkee
Motivation: some good seniors got intern, so i was inspired.
Funny Moments: on the interview day a person came into the conference room to call me for interview, i didnt thought he was interviewer. he was very simple, but intelligent and at last i felt like asking him to ask me one more coding question as it was fun solving questions infront of him, but i didnt do that as i was frightened if i would not be able to answer it would be a negative remark :P .

Skills evaluated in this interview

Airbnb Interview FAQs

How many rounds are there in Airbnb Software Engineer interview?
Airbnb interview process usually has 2 rounds. The most common rounds in the Airbnb interview process are Coding Test and One-on-one Round.
How to prepare for Airbnb Software Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Airbnb. The most common topics and skills that interviewers at Airbnb expect are Data Structures, Python, C++, Backend and Architecture.

Tell us how to improve this page.

Airbnb Software Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Airbnb Software Engineer Salary
based on 14 salaries
₹18 L/yr - ₹60 L/yr
345% more than the average Software Engineer Salary in India
View more details

Airbnb Software Engineer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

3.0

Skill development

4.0

Work-life balance

5.0

Salary

3.0

Job security

5.0

Company culture

4.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
Business Analyst
27 salaries
unlock blur

₹9 L/yr - ₹24 L/yr

Senior Analyst
27 salaries
unlock blur

₹4.2 L/yr - ₹16.8 L/yr

Claims Specialist
24 salaries
unlock blur

₹5.1 L/yr - ₹10 L/yr

Resolution Specialist
21 salaries
unlock blur

₹4.3 L/yr - ₹7 L/yr

Team Coordinator
20 salaries
unlock blur

₹6 L/yr - ₹20 L/yr

Explore more salaries
Compare Airbnb with

Facebook

4.3
Compare

Google

4.4
Compare

Uber

4.2
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview