Katkat

practice a little every day, paws crossed ♡

Software Engineer 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 1921–1950 of 2629 results

  • 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
  • Point72HardSoftware Engineer
    Maximize Fixed Positions After Deletions

    This problem tests your ability to use dynamic programming and data structures to maximize elements in a subsequence that align with their new indices after removing elements.

    Coding & AlgorithmsOnline AssessmentDynamic ProgrammingGreedyData Structures
  • Point72HardSoftware Engineer
    Simulate a Deterministic Finite Automaton

    Implement and run a Deterministic Finite Automaton (DFA) simulator that parses state transitions over a binary alphabet and determines if input strings are accepted.

    Coding & AlgorithmsOnline AssessmentFinite AutomataState MachineDesign
  • 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
  • PurestorageMediumSoftware Engineer
    Determine whether points form squares

    This question evaluates computational geometry, combinatorial counting, and algorithmic optimization skills by requiring validation of a non-degenerate square from four 2D integer points and counting distinct squares in a larger point set, and it falls under the Coding & Algorithms category.

    Coding & AlgorithmsOnsite
  • 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
  • QuinceMediumSoftware Engineer
    Check Whether a Word Repeated K Times Is a Subsequence

    This problem tests the ability to optimize string pattern matching by using modular arithmetic and pointer manipulation to avoid unnecessary memory allocation.

    Coding & AlgorithmsOnline AssessmentStringsTwo PointersGreedy
  • QuinceMediumSoftware Engineer
    Open the Minimum Number of Sprinklers to Cover a Garden

    This problem tests greedy algorithm design and interval scheduling techniques to solve a coverage optimization task.

    Coding & AlgorithmsOnline AssessmentGreedyIntervalsSorting
  • 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
  • RampHardSoftware Engineer
    Detect recurring transactions from a ledger

    This question evaluates skills in detecting temporal recurrence patterns in transaction data, including time-series analysis, date arithmetic, grouping by merchant and currency, and tolerance handling for amounts and date jitter.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Find User Airport at a Time

    This problem tests your ability to efficiently query temporal interval data for a specific user using binary search and interval manipulation.

    Coding & AlgorithmsTechnical ScreenSortingBinary SearchIntervals
  • RampMediumSoftware Engineer
    Find an Exit in a URL Maze

    This question evaluates graph traversal and state-management skills, emphasizing handling cycles, HTTP error conditions, retry logic, and propagation of authorization tokens in a networked client.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Find exit URL via BFS API calls

    This question evaluates graph traversal and resilience when interacting with HTTP APIs, covering BFS/DFS reasoning, cycle detection to avoid infinite loops, retry handling for transient HTTP 500 responses, and timeout management for slow pages.

    Coding & AlgorithmsTechnical Screen
  • RampMediumSoftware Engineer
    Implement a multi-level digital recipe manager

    Tests skills in data modeling and stateful class implementation, covering CRUD operations, case-insensitive string handling, recipe ID generation, list management, search and sort logic, and basic user/edit permissions.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Implement multi-level task manager APIs

    This question evaluates implementation skills for stateful in-memory data structures, API evolution handling, substring search and prioritized sorting, and time-windowed assignment logic with quota enforcement in the Coding & Algorithms domain, and is primarily a practical application problem rather than a purely conceptual one.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Maximize Earnings by Converting Days Off into Workdays

    This question evaluates a candidate's skill in dynamic programming and constrained optimization, specifically deciding which state transitions to modify under a limited budget of changes. It falls under coding and algorithms interviews, testing practical application of greedy or DP reasoning over sequential data with adjacency-based bonuses rather than pure conceptual knowledge.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Maximum Profit from Dated Stock Trade Records

    This question evaluates a candidate's ability to design an efficient single-pass algorithm for grouped time-series data, tracking per-symbol running minimums to compute maximum achievable profit. It tests array processing, hash-map grouping, and edge-case handling for unsorted records, commonly used in coding interviews to assess practical algorithmic problem-solving rather than pure theory.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Maximum Profit from Multi-Stock Trading Records

    This question evaluates a candidate's ability to parse and sort unstructured event data, then apply a greedy or dynamic-programming strategy for maximizing profit across multiple independent series. It falls under coding and algorithms, commonly used to assess array processing, state tracking, and stock-trading pattern recognition at a practical implementation level.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Multi-Level Warehouse Storage with Weighted Retrieval

    This question evaluates a candidate's ability to design an object-oriented data structure with multiple prioritized eviction and expiration rules. It tests skills in coding and algorithms, specifically simulating TTL-based expiry alongside tiered, capacity-aware selection logic. Such multi-rule state machine problems are common in interviews to assess careful requirement tracking and practical implementation of layered constraints.

    Coding & AlgorithmsOnline Assessment
  • RampMediumSoftware Engineer
    Navigate maze via HTTP API

    This question evaluates a candidate's ability to implement programmatic traversal of linked resources via an HTTP API, testing skills in network I/O, control flow, state management, and algorithmic traversal.

    Coding & AlgorithmsTechnical Screen