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 61–90 of 3276 results
- AirbnbMediumMachine Learning EngineerRedact Document Phrases with Simultaneous Replacement
Redact document phrases with a replacement map, whole-word matching, longest-match overlap rules, and one-pass replacement of original text.
Coding & AlgorithmsOnsite - 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 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 - AirbnbMediumMachine Learning EngineerSolve Decimal Coin Change
This question evaluates proficiency in dynamic programming for coin-change problems and competency in numerical precision and safe handling of decimal monetary values in algorithmic implementations.
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 - 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 - AirwallexMediumBackend EngineerMaximum Triangle Path Sum, Overall and Through a Required Cell
Given an integer triangle where each step moves to one of the two adjacent cells in the next row, return the maximum top-to-bottom path sum and the maximum sum among paths forced through a given cell. Tests dynamic programming on a triangle and adapting it to a constrained follow-up.
Coding & AlgorithmsOther - Akuna CapitalMediumData EngineerCompute Graph Spread and Portfolio Trades
This problem tests graph traversal (connected components) and hash-map manipulation to calculate net delta changes in portfolio assets within identified groups.
Coding & AlgorithmsOnline AssessmentGraphDFS/BFSHash Map - Akuna CapitalMediumSoftware EngineerCompute max profit across dated stock quotes
This question evaluates a candidate's ability to reason about time-series and transaction-constrained optimization, including handling unsorted inputs, duplicate records, and constructing an explicit sequence of trades under ordering and no-short-selling constraints.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerCompute min operations to transform integers
This question evaluates algorithmic problem-solving skills related to integer transformations and reasoning about sequences of allowed operations, focusing on optimizing the number of steps. It is commonly used in the Coding & Algorithms domain to assess practical application of algorithmic thinking and time-complexity analysis, testing efficiency reasoning rather than purely conceptual knowledge.
Coding & AlgorithmsOnline Assessment - 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 EngineerDesign two-user communications handler with exceptions
This question evaluates object-oriented design, state management, and custom exception handling skills for enforcing a single active communication pair and related invariants between two users.
Coding & AlgorithmsHR Screen - Akuna CapitalHardData ScientistFind minimum swaps to sort array with duplicates
This question evaluates array manipulation and permutation-based reasoning for minimizing swap operations, including handling of duplicate values and performance considerations, within the Coding & Algorithms domain for a Data Scientist role.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerHeapify an array into a max-heap
This question evaluates understanding of heap data structures and the in-place bottom-up heapify algorithm for building a max-heap on a 0-indexed array, testing skills in array manipulation, heap invariants, and algorithmic reasoning.
Coding & AlgorithmsOnline Assessment - 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 - Akuna CapitalMediumSoftware EngineerSolve swaps, graph paths, and movie DP
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve swaps, graph paths, and movie DP states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerSolve three C++ algorithmic tasks
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve three C++ algorithmic tasks states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - Akuna CapitalMediumSoftware EngineerTrace code and find frequent character
Trace code and find frequent character evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnline Assessment - 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 EngineerAdd One Source to Minimize Grid Inconvenience
Minimize the worst inconvenience in a binary grid by adding one colored source. Movement is allowed in eight directions, and the solution must handle grids that begin with no source at all.
Coding & AlgorithmsOnline Assessment - 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
Airbnb
Airtable
Airwallex
Akuna Capital
Alibaba
Amazon