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 1171–1200 of 1706 results

  • PinterestMediumSoftware Engineer
    Remove and Compact a Parent-Index Forest

    Tests tree traversal to find subtrees, array compaction, and index remapping on a parent-pointer forest representation without mutating input data.

    Coding & AlgorithmsTechnical Screentreearraybfs
  • PinterestMediumSoftware Engineer
    Round numeric string values

    This question evaluates parsing and numeric manipulation skills, specifically implementing rounding rules for numeric strings and handling decimals, significant digits, and precision edge cases.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Select the Nearest Eligible Elevator

    Implement an elevator dispatch selection algorithm that finds the nearest eligible elevator for a passenger request based on floor, direction, and tie-breaking rules.

    Coding & AlgorithmsTechnical Screenarrayssimulationgreedy
  • PinterestMediumSoftware Engineer
    Settle Group Expenses with Transfers

    This question evaluates the ability to compute and reconcile per-person financial balances from transactional data and to translate net liabilities into direct transfers, exercising skills in numeric bookkeeping and data aggregation.

    Coding & AlgorithmsTechnical Screen
  • PinterestMediumSoftware Engineer
    Solve Multiple Coding Interview Problems

    Tests breadth-first search and bipartite/dual-graph modeling to find the minimum number of transit lines needed to travel between two stops.

    Coding & AlgorithmsTechnical ScreenGraphBFSHash Table
  • PinterestMediumSoftware Engineer
    Solve Two Grid Search Problems

    This problem tests your ability to navigate 2D grids and apply graph traversal algorithms to identify connected components and calculate propagation distances.

    Coding & AlgorithmsTechnical ScreenGraph TheoryBFSDFS
  • PinterestHardMachine Learning Engineer
    Solve a 9x9 Sudoku puzzle

    This question evaluates algorithmic problem-solving skills focused on constraint satisfaction, state-space search, and implementation correctness for combinatorial puzzles.

    Coding & AlgorithmsTechnical Screen
  • PlaidMediumSoftware Engineer
    Calculate Ordered Job Makespan Across Parallel Workers

    Calculate the total makespan required to process a queue of ordered jobs across a fixed pool of identical parallel workers.

    Coding & AlgorithmsTechnical ScreenHeapGreedySimulation
  • PlaidMediumSoftware Engineer
    Compute discounted prices in a queue

    This question evaluates proficiency in array processing, algorithm design, use of auxiliary data structures such as monotonic stacks, and formal complexity and correctness reasoning.

    Coding & AlgorithmsTechnical Screen
  • PlaidMediumSoftware Engineer
    Count Completed Jobs in a Serial Multi-Worker Pipeline

    Calculate the total number of jobs completed by a given deadline across a multi-stage pipelined system with worker pools. The solution requires simulating stage-by-stage batch execution, tracking wave durations, and enforcing barrier synchronization between stages.

    Coding & AlgorithmsTechnical ScreenSimulationDynamic ProgrammingQueue
  • PlaidMediumSoftware Engineer
    Count Completed Jobs in a Serial Single-Worker Pipeline

    Determine the total number of jobs completed by a single worker executing a sequence of stage-gated tasks before a time limit expires. Tests linear simulation, division/modulo arithmetic, handling of zero-duration and zero-count edge cases, and 64-bit integer safety.

    Coding & AlgorithmsTechnical ScreenSimulationMathGreedy
  • PlaidMediumSoftware Engineer
    Design a coupon redemption system

    This question evaluates proficiency in data structures and algorithms for building an in-memory service, including efficient lookup/update strategies, expiration handling, limit enforcement, idempotency, concurrency considerations, and time/space complexity reasoning.

    Coding & AlgorithmsTechnical Screen
  • PlaidEasySoftware Engineer
    Resolve routing-number to bank mapping

    This question evaluates a candidate's skills in data normalization, deduplication, aggregation, and conflict resolution across multiple JSON data sources, with emphasis on canonicalization of aliases and handling inconsistent mappings.

    Coding & AlgorithmsTechnical Screen
  • PlaidMediumSoftware Engineer
    Validate Evaluation Chains and Resolve Boolean Outcomes

    Implement a graph traversal to resolve Boolean evaluation chains with negation, detecting cycles, paths leading to cycles, and undefined references in linear time.

    Coding & AlgorithmsTechnical ScreenGraphDFSCycle Detection
  • PlaidMediumSoftware Engineer
    Validate and Resolve Chained Decision Rules

    Determine if all rules in a chained decision rule set resolve to a terminal 'pass' outcome without cycles or missing references.

    Coding & AlgorithmsTechnical ScreenGraphDFSCycle Detection
  • Point72MediumData Scientist
    Classify relationships for multiple circle pairs

    This question evaluates computational geometry skills, careful integer arithmetic for numeric precision, case-based classification logic, and analysis of time and space complexity in the Coding & Algorithms domain for Data Scientist roles.

    Coding & AlgorithmsTechnical Screen
  • Point72MediumData Scientist
    Determine Circle Intersection Status for Rendering Order

    This question evaluates geometric reasoning and computational-geometry competency, including spatial relationship analysis and handling numerical edge cases relevant to pairwise object interaction.

    Coding & AlgorithmsTechnical Screen
  • Point72MediumQuantitative Researcher
    Find the Minimum in a Rotated Sorted Array

    A strictly increasing array of distinct integers has been rotated at an unknown pivot. Work through the function contract, boundary cases, correctness argument, and time and space complexity expected in a production-quality solution.

    Coding & AlgorithmsTechnical Screen
  • Point72MediumMachine Learning Engineer
    Find the Smallest String After One Decrement

    This question evaluates string manipulation, lexicographic ordering, and reasoning about local character transformations including wrap-around behavior.

    Coding & AlgorithmsTechnical Screen
  • Point72HardData Engineer
    Implement Portfolio Trading Optimizer

    This question evaluates algorithmic problem-solving, array processing, input validation via decorators, and the ability to produce concise transaction reports for maximizing non-overlapping buy/sell profits.

    Coding & AlgorithmsTechnical Screen
  • Point72MediumData Scientist
    Maximize outfits with distinct colors

    This question evaluates competency in combinatorial optimization and constrained resource-allocation algorithms, along with analysis of time and space complexity and robustness to skewed input distributions and edge cases.

    Coding & AlgorithmsTechnical Screen
  • Pony.AiMediumSoftware Engineer
    Implement a Min-Heap with Insert and Remove-Min

    Implement a binary min-heap from scratch using a zero-indexed array, supporting insertion, peek, and extraction of the minimum element in logarithmic time.

    Coding & AlgorithmsTechnical ScreenHeapData StructuresBinary Heap
  • PurestorageMediumSoftware Engineer
    Count All-One Square Submatrices

    Tests dynamic programming and 2D grid traversal skills by counting the total number of square submatrices filled entirely with ones.

    Coding & AlgorithmsTechnical Screendynamic-programmingmatrixarrays
  • QualcommMediumSoftware Engineer
    Compute the Diameter of an Undirected Tree

    Compute the diameter of a large undirected tree, measured by the number of edges on its longest simple path. The exercise tests adjacency construction, linear-time tree traversal, endpoint reasoning, recursion-depth awareness, and edge cases such as a single-node tree.

    Coding & AlgorithmsTechnical Screen
  • QualcommMediumSoftware Engineer
    Find the First Bad Version in a Monotonic Release History

    Find the earliest bad entry in a monotonic release history, returning -1 when every version is good. This compact coding prompt tests boundary-safe binary search, empty and all-good inputs, first-element failures, loop invariants, and logarithmic performance on histories with up to a million versions.

    Coding & AlgorithmsTechnical Screen
  • QualcommMediumSoftware Engineer
    Implement A* Maze Search

    This question evaluates proficiency in informed search algorithms, heuristic design (admissibility), grid-based graph traversal, path reconstruction, and time/space complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • Qube Research & TechnologiesHardSoftware Engineer
    Compute expected days until no whole pills

    This problem tests your ability to model a stochastic process using a system of linear equations and solve it using expectation theory.

    Coding & AlgorithmsTechnical ScreenProbabilityExpectationDynamic Programming
  • Qube Research & TechnologiesMediumSoftware Engineer
    Implement flat_map and design wealth redistribution

    This question evaluates low-level data structure implementation skills (designing an associative flat_map with sorted dynamic array storage, unique-key semantics, iterator correctness and amortized complexity) alongside algorithmic optimization and proof-based reasoning for integer-constrained wealth redistribution.

    Coding & AlgorithmsTechnical Screen
  • Qube Research & TechnologiesMediumSoftware Engineer
    Implement flat_map, redistribute wealth evenly

    This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement flat_map, redistribute wealth evenly states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.

    Coding & AlgorithmsTechnical Screen
  • QuoraMediumSoftware Engineer
    Count distinct palindromic subsequences

    This question evaluates proficiency in string algorithms and combinatorial counting, focusing on recognition and enumeration of palindromic subsequences and techniques for deduplicating distinct results.

    Coding & AlgorithmsTechnical Screen