Katkat

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 1–30 of 1706 results

  • 6SenseMediumSoftware Engineer
    Count Squares from Points in the Plane

    This problem tests your ability to efficiently store spatial coordinates and leverage geometric properties (like midpoints or diagonals) to detect squares within a 2D plane.

    Coding & AlgorithmsTechnical ScreenGeometryHash SetArrays
  • Abnormal SecurityMediumSoftware Engineer
    Design a duplicate-file removal algorithm

    Design a duplicate-file removal algorithm 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 & AlgorithmsTechnical Screen
  • AccentureMediumSoftware Engineer
    Find minimum racks for 2D bin packing

    This question evaluates understanding of combinatorial optimization and multi-dimensional bin packing, assessing algorithmic design, resource-allocation reasoning, and computational complexity awareness.

    Coding & AlgorithmsTechnical Screen
  • AddeparMediumSoftware Engineer
    Implement a Transactional In-Memory Table

    Design an in-memory tabular data store that supports transactional modifications (create, update, delete, find-and-replace) with commit and rollback capabilities.

    Coding & AlgorithmsTechnical ScreenObject-Oriented DesignData StructuresDatabase Internals
  • Additive AiMediumSoftware Engineer
    Advance Game of Life with Reduced Auxiliary Storage

    This problem tests array manipulation techniques, specifically bitwise operations and modular arithmetic, to transform a grid in-place while preserving original state information for simultaneous updates.

    Coding & AlgorithmsTechnical ScreenArraysBit ManipulationMatrix
  • AdiaEasyData Scientist
    Compute Score Difference in Reversing Array Game

    This question tests the ability to manage state changes while iterating through an array based on index-dependent rules, specifically involving conditional array modifications.

    Coding & AlgorithmsTechnical ScreenArraysSimulationDeque
  • AdobeMediumSoftware Engineer
    Build a React team builder with role constraints

    This problem tests your ability to manage complex UI state in React, enforce business constraints (role limits) during data manipulation, and implement stable UI rendering based on sorted state.

    Coding & AlgorithmsTechnical ScreenReactState ManagementFrontend
  • AdobeMediumSoftware Engineer
    Design a nested-list iterator

    This question evaluates the ability to implement an efficient iterator over nested lists, testing skills in iterator state management, lazy traversal, explicit stack usage, and algorithmic complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • AdobeMediumSoftware Engineer
    Determine feasible task ordering

    This question evaluates knowledge of graph algorithms and dependency management, emphasizing concepts such as topological ordering and cycle detection and the ability to determine feasibility and produce a valid execution sequence.

    Coding & AlgorithmsTechnical Screen
  • AdobeMediumSoftware Engineer
    Determine task order with prerequisites

    This question evaluates a candidate's proficiency with graph-theoretic concepts like dependency modeling and cycle detection, and their ability to produce valid task orderings under constraints within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • AdobeMediumMachine Learning Engineer
    Implement K-means clustering from scratch

    This problem tests your understanding of the K-means clustering algorithm, specifically the iterative process of centroid initialization, assignment, and update steps.

    Coding & AlgorithmsTechnical ScreenK-meansClusteringUnsupervised Learning
  • AdobeMediumSoftware Engineer
    Implement file word count

    This question evaluates a candidate's skills in text processing, large-scale I/O, token normalization, memory-constrained computation and algorithmic trade-offs for frequency aggregation, and it falls under the Coding & Algorithms domain because it combines parsing, data structures and external processing concerns.

    Coding & AlgorithmsTechnical Screen
  • AdobeMediumSoftware Engineer
    Traverse a path and print directory tree

    This problem tests your ability to recursively traverse a directory structure and format the output into a human-readable, indented tree structure while handling potential I/O errors.

    Coding & AlgorithmsTechnical ScreenRecursionNode.jsFilesystem
  • AdyenMediumSoftware Engineer
    Implement LRU and target-sum combinations

    Implement LRU and target-sum combinations 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 & AlgorithmsTechnical Screen
  • AeoneaMediumSoftware Engineer
    Find two numbers summing to target

    This question evaluates algorithm design and complexity analysis skills, specifically the ability to identify element pairs in arrays and reason about time-space tradeoffs.

    Coding & AlgorithmsTechnical Screen
  • AeoneaMediumSoftware Engineer
    Implement a tennis score tracker

    This question evaluates a candidate's ability to implement stateful scoring logic and choose appropriate data structures for tracking sequential events, specifically handling tennis scoring rules such as 0/15/30/40 progression, Deuce, Advantage, and the two-point lead requirement.

    Coding & AlgorithmsTechnical Screen
  • AffirmMediumSoftware Engineer
    Aggregate loans and match repayments

    Implement a transaction matching engine that aggregates user loans and allocates repayments chronologically to outstanding balances using a FIFO waterfall approach.

    Coding & AlgorithmsTechnical Screenarrayshash-tablesorting
  • AffirmMediumSoftware Engineer
    Detect fraud events and extract PII

    This problem tests your ability to process nested JSON-like structures, perform deduplication, and map related entities to detect fraudulent patterns.

    Coding & AlgorithmsTechnical ScreenGraphHash MapDSU
  • AffirmMediumSoftware Engineer
    Determine Redeemable Promotion Offers

    This problem tests your ability to manage stateful constraints by processing a stream of promotional event logs to determine if a user remains eligible for a discount based on a per-user, per-promotion usage limit.

    Coding & AlgorithmsTechnical ScreenHashMapsDataAggregationStreamProcessing
  • AffirmMediumSoftware Engineer
    Find shortest unique substring per word

    This problem tests your ability to manipulate string data structures (like Tries or Suffix Trees) to efficiently identify the shortest, lexicographically smallest substring that is unique to a given word within a provided collection.

    Coding & AlgorithmsTechnical ScreenStringsTrieHash Map
  • AgodaMediumSoftware Engineer
    Compute triangle min path and dice stopping stats

    This composite question evaluates dynamic programming and algorithmic optimization via the triangle minimum path problem and probability, stopping-time analysis and Monte Carlo simulation through the two-dice experiment, testing competencies in DP, discrete probability, expected-value reasoning and empirical estimation.

    Coding & AlgorithmsTechnical Screen
  • AgodaEasyData Engineer
    Count Integers That Appear Exactly Once

    Count distinct integers with frequency exactly one using complete occurrence counts, including empty arrays and separated duplicates.

    Coding & AlgorithmsTechnical Screen
  • AgodaMediumSoftware Engineer
    Find two numbers that sum to a target

    This question evaluates array manipulation, index-based reasoning, and algorithmic problem-solving skills related to identifying value pairs that meet a numeric target.

    Coding & AlgorithmsTechnical Screen
  • Ai2MediumSoftware Engineer
    Maintain an Out-of-Order Step Progress Tree

    This problem tests tree reconstruction from a stream of out-of-order parent-child updates, requiring efficient hierarchical state management and cycle detection.

    Coding & AlgorithmsTechnical ScreenTreesGraphsData Structures
  • Aim Intelligent MachineMediumSoftware Engineer
    Merge Overlapping Closed Intervals into a Sorted Disjoint List

    Tests sorting and linear scanning techniques to merge overlapping closed intervals, with attention to shared boundaries, nested ranges, and large input scale.

    Coding & AlgorithmsTechnical ScreenIntervalsSortingArray
  • AirbnbMediumSoftware Engineer
    Compute minimum-cost service cover

    This question evaluates proficiency in combinatorial optimization and set-coverage with cost minimization, including handling case-insensitive service matching and enumerating minimal solution combinations.

    Coding & AlgorithmsTechnical Screen
  • AirbnbMediumSoftware Engineer
    Compute split-stay listing pairs

    This question evaluates the ability to manipulate interval availability data, reason about contiguous date ranges and split boundaries, and design efficient pairing algorithms with attention to time and space complexity.

    Coding & AlgorithmsTechnical Screen
  • AirbnbMediumSoftware Engineer
    Construct smallest number from I/D pattern

    This problem tests greedy algorithm design and stack-based data structure manipulation to satisfy relative ordering constraints within a sequence of digits.

    Coding & AlgorithmsTechnical ScreenGreedyStackStrings
  • AirbnbMediumSoftware Engineer
    Count Candies from Unlockable Boxes

    Determine the maximum number of candies you can collect given an initial set of boxes, where each box may be locked or unlocked, contain candies, contain keys to other boxes, and contain other boxes.

    Coding & AlgorithmsTechnical ScreenBreadth-First SearchGraphQueue
  • AirbnbMediumSoftware Engineer
    Design and implement Connect Four engine

    This question evaluates a candidate's competency in algorithmic problem solving, data structure selection, API design, complexity analysis, and testing through implementation of a Connect Four game engine.

    Coding & AlgorithmsTechnical Screen