Coding & Algorithms interview questions

Showing 61–90 of 3276 results

• Redact Document Phrases with Simultaneous ReplacementMedium

  Redact document phrases with a replacement map, whole-word matching, longest-match overlap rules, and one-pass replacement of original text.

  AirbnbMachine Learning EngineerCoding & AlgorithmsOnsite
• Render Wrapped Paragraphs Inside One Text BoxMedium

  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.

  AirbnbSoftware EngineerCoding & AlgorithmsOnsite
• Review Python geodata codeMedium

  This question evaluates proficiency in Python code review and geolocation data-processing, including competencies in readability, correctness, performance optimization, and architectural scalability.

  AirbnbSoftware EngineerCoding & AlgorithmsOnsite
• Simulate pouring water onto terrainMedium

  This problem tests your ability to model a fluid simulation on a grid using a deterministic rule set and efficient array traversal.

  AirbnbSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve Decimal Coin ChangeMedium

  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.

  AirbnbMachine Learning EngineerCoding & AlgorithmsOnsite
• Solve Linked-List and Iterator ProblemsMedium

  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.

  AirbnbSoftware EngineerCoding & AlgorithmsOnsite
• Solve a Two-by-Three Sliding PuzzleHard

  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.

  AirbnbSoftware EngineerCoding & AlgorithmsOnsite
• Solve palindrome pairs and key pathMedium

  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.

  AirbnbSoftware EngineerCoding & AlgorithmsOnsite
• Count business days excluding holidaysMedium

  This problem tests date manipulation skills and the ability to efficiently calculate working day durations while accounting for dynamic holiday schedules.

  AirtableSoftware EngineerCoding & AlgorithmsOnsite
• Implement BFS serializer and deserializerMedium

  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.

  AirtableSoftware EngineerCoding & AlgorithmsOnsite
• Find All Index Quadruples Summing to a Target Without Losing PositionsMedium

  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.

  AirwallexSoftware EngineerCoding & AlgorithmsTechnical Screen
• Largest Square of OnesMedium

  Tests dynamic programming on a 2D grid, specifically optimizing state transitions to achieve O(n) auxiliary space.

  AirwallexSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximum Triangle Path Sum, Overall and Through a Required CellMedium

  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.

  AirwallexBackend EngineerCoding & AlgorithmsOther
• Compute Graph Spread and Portfolio TradesMedium

  This problem tests graph traversal (connected components) and hash-map manipulation to calculate net delta changes in portfolio assets within identified groups.

  Akuna CapitalData EngineerCoding & AlgorithmsOnline Assessment
• Compute max profit across dated stock quotesMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Compute min operations to transform integersMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Count subarrays equal to targetMedium

  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.

  Akuna CapitalData ScientistCoding & AlgorithmsTechnical Screen
• Design two-user communications handler with exceptionsMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsHR Screen
• Find minimum swaps to sort array with duplicatesHard

  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.

  Akuna CapitalData ScientistCoding & AlgorithmsOnline Assessment
• Heapify an array into a max-heapMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement a ring bufferMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Distinct Values with Cross-Array SwapsHard

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize profitable pairsMedium

  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.

  Akuna CapitalData ScientistCoding & AlgorithmsTechnical Screen
• Minimum Movement Cost to Segregate Binary DigitsHard

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Solve swaps, graph paths, and movie DPMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Solve three C++ algorithmic tasksMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Trace code and find frequent characterMedium

  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.

  Akuna CapitalSoftware EngineerCoding & AlgorithmsOnline Assessment
• Fixed-Capacity Cache That Evicts the Least Frequently Used Key, Ties by RecencyMedium

  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.

  AlibabaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Add One Source to Minimize Grid InconvenienceMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsOnline Assessment
• Answer a large batch of variable-ratio queries from division equationsMedium

  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.

  AmazonSoftware EngineerCoding & AlgorithmsTechnical Screen