practice a little every day, paws crossed ♡
Coding & Algorithms 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 31–60 of 1706 results
- AirbnbMediumSoftware EngineerDetermine Exact Layover Booking
Determine if a subset of layover activities can be booked such that their total cost exactly matches a target voucher balance, handling floating-point currency without precision loss.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingBacktrackingSubset Sum - AirbnbMediumSoftware EngineerFind minimal property set in neighborhood
This question evaluates combinatorial optimization and algorithm design skills, focusing on capacity-constrained selection (subset-sum/knapsack-style reasoning), deterministic tie-breaking, and complexity analysis within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - AirbnbMediumSoftware EngineerImplement Connect Four game
This question evaluates implementation skills for game state management, move handling, and efficient winner-detection algorithms, testing competence in data structures, algorithmic complexity analysis, and correctness under edge cases.
Coding & AlgorithmsTechnical Screen - AirbnbEasySoftware EngineerImplement Text Layout and Query Parsing
Implement URL query parameter extraction and a greedy text line-wrapper that enforces maximum line length and prevents orphan words on the final line.
Coding & AlgorithmsTechnical ScreenStringsParsingGreedy - AirbnbEasySoftware EngineerImplement a Removable Nested-List Iterator
Design and implement a nested-list iterator supporting `hasNext`, `next`, and an in-place `remove` operation that alters the original data structure.
Coding & AlgorithmsTechnical ScreenDesignStackRecursion - AirbnbMediumSoftware EngineerMaximize path score in DAG
This question evaluates proficiency in graph algorithms and optimization, focusing on reasoning about weighted directed acyclic graphs and maximizing a path score that combines node rewards and edge time costs.
Coding & AlgorithmsTechnical Screen - AirbnbMediumMachine Learning EngineerMinimum Canisters to Top Up an Exact Target
Tests dynamic programming for the unbounded knapsack/coin change problem, focusing on finding the minimum number of canisters to reach an exact volume and reconstructing the optimal selection.
Coding & AlgorithmsTechnical Screendynamic-programmingknapsackarrays - AirbnbMediumSoftware EngineerSimulate pouring water onto terrain
This problem tests your ability to model a fluid simulation on a grid using a deterministic rule set and efficient array traversal.
Coding & AlgorithmsTechnical ScreenSimulationArrayGrid - AirwallexMediumSoftware EngineerFind All Index Quadruples Summing to a Target Without Losing Positions
Given an integer array and a target, return every quadruple of original indices i < j < k < l whose values sum to the target, in lexicographic order. Tests an efficient search beyond brute force, index-based deduplication, overflow awareness and handling of repeated values without losing positions.
Coding & AlgorithmsTechnical Screen - AirwallexMediumSoftware EngineerLargest Square of Ones
Tests dynamic programming on a 2D grid, specifically optimizing state transitions to achieve O(n) auxiliary space.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingMatrixSpace Optimization - Akuna CapitalMediumData ScientistCount subarrays equal to target
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 subarrays equal to target states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Akuna CapitalMediumSoftware EngineerImplement a ring buffer
This question evaluates implementation skills for fixed-capacity circular buffers and competency in array-based data structures, including O(1) push/pop/peek/isEmpty/isFull/size operations and logical-order iteration.
Coding & AlgorithmsTechnical Screen - Akuna CapitalHardSoftware EngineerMaximize Distinct Values with Cross-Array Swaps
This problem tests greedy strategy optimization and frequency counting to maximize the count of unique elements across two arrays after a limited number of swaps.
Coding & AlgorithmsTechnical ScreenGreedyArraysHashing - Akuna CapitalMediumData ScientistMaximize profitable pairs
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Maximize profitable pairs states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - Akuna CapitalHardSoftware EngineerMinimum Movement Cost to Segregate Binary Digits
This problem tests greedy algorithm design and sequence optimization by calculating the cumulative distance required to shift all '1's to the end of a binary string.
Coding & AlgorithmsTechnical ScreenGreedyStringsArrays - AlibabaMediumSoftware EngineerFixed-Capacity Cache That Evicts the Least Frequently Used Key, Ties by Recency
Build a fixed-capacity key-value cache that evicts the key with the fewest uses, breaking ties by least recent use, and replay a sequence of get and put operations to return each read result. It tests careful per-key frequency and recency tracking with constant average time per operation.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerAnswer a large batch of variable-ratio queries from division equations
Given division equations between named variables and their values, answer a large batch of ratio queries, returning -1.0 whenever a ratio cannot be determined. It tests chaining ratios through shared variables, handling unknown and disconnected variables, and reusing work across many queries, the scale follow-up raised in the interview.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerAnswer two coding questions (SQL and DP)
This problem tests SQL data aggregation skills with NULL handling and algorithmic proficiency in dynamic programming to count palindromic subsequences in a string.
Coding & AlgorithmsTechnical ScreenSQLDynamic ProgrammingAggregation - AmazonMediumSoftware EngineerBuild a BFS Web Crawler
This question evaluates understanding of breadth-first traversal, URL normalization, domain scoping, duplicate detection, and retry/error handling, measuring algorithmic design and robustness in networked code.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCaesar Cipher with Translation-Table Optimization
This question tests string manipulation, modular arithmetic, and the ability to optimize performance by trading space for time using a precomputed lookup table.
Coding & AlgorithmsTechnical ScreenStringsOptimizationAlgorithms - AmazonMediumSoftware EngineerCalculate Circular Route Query Distance
This question evaluates a candidate's ability to reason about circular arrays, distance computations, and query-efficient algorithms, assessing concepts such as modular indexing and cumulative distances.
Coding & AlgorithmsTechnical Screen - AmazonEasySoftware EngineerCheck a Palindrome While Ignoring Case and Punctuation
Tests string manipulation and two-pointer traversal techniques to verify if a string is a palindrome while ignoring non-alphanumeric characters and case.
Coding & AlgorithmsTechnical ScreenStringsTwo PointersEasy - AmazonMediumApplied ScientistCheck if adding edge creates cycle in digraph
This question evaluates understanding of graph algorithms, reachability, and algorithmic complexity by determining whether adding a directed edge would introduce a cycle in an otherwise acyclic directed graph.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute Edit Distance
Tests dynamic programming and string manipulation by calculating the minimum number of single-character edits (insertions, deletions, substitutions) needed to transform one string into another.
Coding & AlgorithmsTechnical ScreenDynamic ProgrammingStringsAlgorithms - AmazonMediumSoftware EngineerCompute Latencies and Search Grid Path
This question evaluates parsing and processing of timestamped event logs to compute message latencies and implementation of constrained grid path search, testing competencies in file I/O, record alignment/matching, time-delta computation, graph traversal, and stateful backtracking.
Coding & AlgorithmsTechnical Screen - AmazonMediumData ScientistCompute array modes with ties and no-mode rule
This question evaluates algorithm design and data-structure skills—frequency counting, hashing, and handling edge cases such as ties and a no-mode rule—within the coding and algorithms domain for data scientist roles.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute peak parking lot occupancy intervals
This question evaluates a candidate's competency in temporal interval reasoning, event-stream processing, and handling incomplete or unsorted logs to determine peak concurrent occupancy.
Coding & AlgorithmsTechnical Screen - AmazonMediumSoftware EngineerCompute shortest path 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 shortest path with obstacles states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - AmazonEasySoftware EngineerCompute the Minimum Number of Meeting Rooms
This problem tests your ability to manage overlapping time intervals efficiently, requiring an understanding of sorting or priority queues to track resource utilization.
Coding & AlgorithmsTechnical ScreenSortingIntervalsGreedy - AmazonMediumSoftware EngineerCompute total revenue from greedy VM rentals
This problem tests your ability to use greedy strategies combined with efficient data structures to manage resource allocation and optimize revenue based on priority-based demand.
Coding & AlgorithmsTechnical ScreenGreedyData StructuresHeap
Airbnb
Airwallex
Akuna Capital
Alibaba
Amazon