Airbnb Interview Questions — 58 DSA Problems

46 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Airbnb LeetCode questions for software engineering interviews.

• Text Justification (HARD) — Array, String, Simulation
• Palindrome Pairs (HARD) — Array, Hash Table, String, Trie
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Flatten 2D Vector (MEDIUM) — Array, Two Pointers, Design, Iterator
• Combination Sum (MEDIUM) — Array, Backtracking
• Smallest Common Region (MEDIUM) — Array, Hash Table, String, Tree, Depth-First Search, Breadth-First Search
• Pour Water (MEDIUM) — Array, Simulation
• Cheapest Flights Within K Stops (MEDIUM) — Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Alien Dictionary (HARD) — Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Sliding Puzzle (HARD) — Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix
• Simple Bank System (MEDIUM) — Array, Hash Table, Design, Simulation
• Shortest Path to Get All Keys (HARD) — Array, Bit Manipulation, Breadth-First Search, Matrix
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Employee Free Time (HARD) — Array, Line Sweep, Sorting, Heap (Priority Queue)
• Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
• Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
• Maximum Candies You Can Get from Boxes (HARD) — Array, Breadth-First Search, Graph
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Contains Duplicate II (EASY) — Array, Hash Table, Sliding Window
• Two Sum (EASY) — Array, Hash Table
• Intersection of Two Linked Lists (EASY) — Hash Table, Linked List, Two Pointers
• Contains Duplicate (EASY) — Array, Hash Table, Sorting
• Mini Parser (MEDIUM) — String, Stack, Depth-First Search
• Regular Expression Matching (HARD) — String, Dynamic Programming, Recursion
• Valid Parentheses (EASY) — String, Stack
• Pyramid Transition Matrix (MEDIUM) — Bit Manipulation, Depth-First Search, Breadth-First Search
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• IP to CIDR (MEDIUM) — String, Bit Manipulation
• Strings Differ by One Character (MEDIUM) — Hash Table, String, Rolling Hash, Hash Function
• Minimum Number of Vertices to Reach All Nodes (MEDIUM) — Graph
• Robot Bounded In Circle (MEDIUM) — Math, String, Simulation
• Add Strings (EASY) — Math, String, Simulation
• Minimize Rounding Error to Meet Target (MEDIUM) — Array, Math, String, Greedy, Sorting
• Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (HARD) — Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix
• Number of Ways to Build House of Cards (MEDIUM) — Math, Dynamic Programming
• Happy Number (EASY) — Hash Table, Math, Two Pointers
• Convert to Base -2 (MEDIUM) — Math
• Design File System (MEDIUM) — Hash Table, String, Design, Trie
• Convert Sorted Array to Binary Search Tree (EASY) — Array, Divide and Conquer, Tree, Binary Search Tree, Binary Tree
• Single Number (EASY) — Array, Bit Manipulation
• Reverse Bits (EASY) — Divide and Conquer, Bit Manipulation
• House Robber (MEDIUM) — Array, Dynamic Programming
• Contains Duplicate III (HARD) — Array, Sliding Window, Sorting, Bucket Sort, Ordered Set
• Maximal Square (MEDIUM) — Array, Dynamic Programming, Matrix
• Design Tic-Tac-Toe (MEDIUM) — Array, Hash Table, Design, Matrix, Simulation
• Subarray Product Less Than K (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum
• Shortest Uncommon Substring in an Array (MEDIUM) — Array, Hash Table, String, Trie
• Design Excel Sum Formula (HARD) — Array, Hash Table, String, Graph, Design, Topological Sort, Matrix
• All O`one Data Structure (HARD) — Hash Table, Linked List, Design, Doubly-Linked List