practice a little every day, paws crossed ♡
Software Engineer Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 1–30 of 854 results
- AMDMediumSoftware EngineerFind the Largest K Elements with Partitioning
Find the largest k occurrences with partition-based selection, sort only the output, and compare quickselect pivot risks with heap and full-sort alternatives.
Coding & AlgorithmsOnsite - AdobeMediumSoftware EngineerFind the Lowest Common Ancestor Only When Both Nodes Exist
Return the lowest common ancestor of two target values only when both are present in a potentially skewed binary tree. Handle absent targets, equal targets, empty input, and cases where one target is the ancestor.
Coding & AlgorithmsOnsite - AdobeMediumSoftware EngineerReturn a Binary Tree in Level Order
Return a binary tree's values grouped by depth in level order while preserving left-to-right order within each level. Handle empty, repeated-value, skewed, and very large trees without changing the requested nested output shape.
Coding & AlgorithmsOnsite - AffirmHardSoftware EngineerCompute Balances and Minimize Settlements
Tests transaction aggregation into net balances and combinatorial optimization (backtracking/bitmask DP) to find the minimum number of settlement transfers needed to clear all debts.
Coding & AlgorithmsOnsiteDynamic ProgrammingBacktrackingBitmask - AffirmEasySoftware EngineerImplement an LRU cache
This question tests the ability to combine a hash map and a doubly linked list to achieve constant-time performance for both data retrieval and update operations in a cache.
Coding & AlgorithmsOnsiteHash MapLinked ListDesign - AirbnbMediumSoftware EngineerAllocate an Order from the Oldest Inventory Batches
Implement a function to allocate an order across inventory batches using FIFO (oldest timestamp first, with batch ID tie-breaker), returning allocation details and any unfilled quantity without mutating the input.
Coding & AlgorithmsOnsitesortinggreedyarrays - AirbnbMediumSoftware EngineerAllocate refund across payments
This question evaluates algorithm design and data-structure selection skills, focusing on greedy allocation, ordering by priority and recency, aggregation of transaction amounts, and analysis of time complexity.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerCompute board-game score from regions
This problem tests your ability to identify connected components in a 2D grid using graph traversal (BFS/DFS) and aggregate properties associated with those components.
Coding & AlgorithmsOnsiteGraph TraversalBFSDFS - AirbnbHardSoftware EngineerCount Consecutive Positive Integer Sums
Count representations of a positive integer as one or more consecutive positive integers, including the one-term representation. Derive the arithmetic condition for each sequence length and use a square-root bound rather than testing every possible starting value.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerDesign mutable sum-tree with fast queries
This question evaluates proficiency in designing dynamic data structures for mutable rooted trees, including maintenance of subtree sums, parent/child link management, and analysis of update and query complexities within the Coding & Algorithms domain; it emphasizes practical application of algorithmic design coupled with conceptual understanding of invariants and amortized complexity. It is commonly asked in technical interviews because it probes reasoning about correctness and performance under mutations, handling edge cases such as subtree deletion and reattachment, and the ability to specify algorithmic approaches and complexity guarantees rather than implementation details.
Coding & AlgorithmsOnsite - AirbnbHardSoftware EngineerDetect overlap of two linked lists with cycles
This problem tests your ability to detect if two linked lists merge, specifically when they may contain cycles, by requiring logic to identify loop entry points and intersection nodes.
Coding & AlgorithmsOnsiteLinked ListTwo PointersCycle Detection - AirbnbMediumSoftware EngineerFind palindrome-forming string pairs
This question evaluates string-processing and algorithmic design skills, including knowledge of efficient lookup data structures, palindrome properties, handling of edge cases, and time/space complexity analysis.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerFind smallest permutation under constraints
This problem tests your ability to manipulate digits and understand greedy strategies to construct the smallest possible number after applying specific constraints.
Coding & AlgorithmsOnsiteGreedyRecursionStrings - AirbnbHardSoftware EngineerFlatten a Nested Integer List
Flatten an arbitrarily deep mixture of integers and lists while preserving left-to-right order. The challenge emphasizes an iterative stack solution that handles empty lists, very deep nesting, and up to 200,000 nodes without mutating the input.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerMaximize profit from non-overlapping jobs
This question evaluates proficiency in weighted interval scheduling, dynamic programming concepts, and the use of efficient data structures for large-scale scheduling problems, including handling duplicate times, large reward values, and memory constraints.
Coding & AlgorithmsOnsite - AirbnbHardSoftware EngineerMaximize sum with no adjacent tree nodes
This problem tests your ability to use tree-based dynamic programming to solve an optimization challenge where you must select a subset of nodes with no two being adjacent, while maximizing the sum of their values.
Coding & AlgorithmsOnsiteTree DPRecursionDFS - AirbnbMediumSoftware EngineerRender Wrapped Paragraphs Inside One Text Box
Implement a text formatting utility that wraps multiple paragraphs at distinct per-paragraph widths and renders them inside a single, uniformly padded ASCII border box.
Coding & AlgorithmsOnsiteStringGreedyImplementation - AirbnbMediumSoftware EngineerReview Python geodata code
This question evaluates proficiency in Python code review and geolocation data-processing, including competencies in readability, correctness, performance optimization, and architectural scalability.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerSolve Linked-List and Iterator Problems
This question evaluates proficiency in linked-list pointer reasoning, cycle detection and shared-reference identification, as well as iterator design for round-robin merging, testing data-structure manipulation, iterator interfaces, and complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - AirbnbHardSoftware EngineerSolve a Two-by-Three Sliding Puzzle
Find the minimum moves needed to solve a 2-by-3 sliding puzzle, or report that the target is unreachable. Model each arrangement as a compact graph state, generate legal swaps involving the blank, and use breadth-first search without revisiting configurations.
Coding & AlgorithmsOnsite - AirbnbMediumSoftware EngineerSolve palindrome pairs and key path
This pair of problems evaluates proficiency with string-processing algorithms and advanced data structures for matching, alongside state-space graph search techniques and state-encoding strategies.
Coding & AlgorithmsOnsite - AirtableMediumSoftware EngineerCount business days excluding holidays
This problem tests date manipulation skills and the ability to efficiently calculate working day durations while accounting for dynamic holiday schedules.
Coding & AlgorithmsOnsiteAlgorithmsDate-TimeOptimization - AirtableMediumSoftware EngineerImplement BFS serializer and deserializer
This question evaluates the skill of serializing and deserializing Python object graphs using BFS, including handling primitives, dictionaries, shared subobjects, and circular references while preserving object identity.
Coding & AlgorithmsOnsite - AmazonHardSoftware EngineerBuild a Searchable Sentence Index
This problem tests your ability to design an in-memory inverted index for text retrieval, requiring efficient tokenization, case-insensitive mapping, and dynamic updates to a collection of sentences.
Coding & AlgorithmsOnsiteHash MapsInverted IndexData Structures - AmazonMediumSoftware EngineerCheck path in N-ary tree
This question evaluates understanding of tree traversal and sequence matching in N-ary trees, including handling non-unique node values and maintaining traversal state across branches.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute fruit spoilage time in a grid
This question evaluates a candidate's understanding of graph traversal concepts, grid-based state propagation, and reachability analysis in time-evolving systems.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute optimal locker placement with obstacles
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Compute optimal locker placement with obstacles states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute product excluding index without division
This question evaluates array-manipulation and algorithmic problem-solving skills, focusing on computing a product-for-each-index using prefix and postfix accumulation concepts while reasoning about edge cases such as zeros, negative numbers, and integer overflow.
Coding & AlgorithmsOnsite - AmazonMediumSoftware EngineerCompute the Median After Each Stream Insertion
This problem tests your ability to maintain dynamic statistics in a data stream using efficient data structures to achieve logarithmic insertion and constant-time retrieval.
Coding & AlgorithmsOnsiteHeapsData StreamsSorting - AmazonMediumSoftware EngineerCount expressions reaching a target sum
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Count expressions reaching a target sum states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite