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 2791–2820 of 3276 results

  • StripeHardSoftware Engineer
    Transit Wallet Ledger: Expiring Vouchers, Zone Fees and Refunds

    Process a stream of wallet events where purchases spend expiring vouchers in priority order before charging a card with zone-based fees, and refunds split between card and new store credit. Tests careful rule-by-rule simulation and integer money math.

    Coding & AlgorithmsTechnical Screensimulationparsingsorting
  • StripeMediumSoftware Engineer
    Validate KYC CSV Records

    Implement a KYC CSV record validator that parses customer records, normalizes fields, and validates tax IDs and owner name matches.

    Coding & AlgorithmsTechnical ScreenStringsData ParsingRule Validation
  • StripeMediumSoftware Engineer
    Validate transactions with risk rules and reporting

    Implement an end-to-end transaction validation pipeline that parses raw CSV records, evaluates behavioral fraud detection rules, and outputs a formatted fixed-width audit report.

    Coding & AlgorithmsTechnical Screenstringsdata-parsingsliding-window
  • StripeMediumSoftware Engineer
    Verify business accounts with progressive KYC rules

    Implement a multi-tier KYC verification function that validates business identity inputs against format requirements and an official registry using token-based normalization.

    Coding & AlgorithmsTechnical ScreenStringsData ValidationParsing
  • StripeMediumSoftware Engineer
    Weekly Maintenance Windows Across Time Zones: Find Usable Slots

    Combine recurring 'open' maintenance windows and 'blackout' periods, declared in different local time zones, into the next usable UTC slots after a notice period; tests interval merging, subtraction and week wrap-around.

    Coding & AlgorithmsOnsiteintervalssortingtime-zones
  • StubHubMediumSoftware Engineer
    Build Event Notification Engine

    This question evaluates a candidate's competency in modular software design and extensibility, algorithmic filtering and ranking, date arithmetic for birthday proximity, geospatial distance computation, and integration with notification services.

    Coding & AlgorithmsOnsite
  • StubHubMediumSoftware Engineer
    Design Composable Event Recommendations

    This problem tests your ability to design a flexible, object-oriented recommendation engine that allows for composable filtering and ranking logic using the strategy or decorator pattern.

    Coding & AlgorithmsOnsiteSystem DesignAlgorithmsOOP
  • StubHubMediumSoftware Engineer
    Implement a Composable Event Recommendation Engine

    This problem tests your ability to design a flexible, object-oriented recommendation pipeline using the Strategy and Composite patterns to handle multiple scoring rules and fallback logic.

    Coding & AlgorithmsOnsiteOOPStrategy PatternRecommendation Systems
  • SumologicMediumSoftware Engineer
    Solve substring and access-log problems

    This problem tests your ability to process log data and perform string manipulation by identifying users who visited a specific URL across multiple days and determining the longest common substring between two modified strings.

    Coding & AlgorithmsOnsiteStringsHashingDynamic Programming
  • SupioEasySoftware Engineer
    Compute max planes shot and session count

    These questions evaluate algorithmic problem-solving skills: the first focuses on greedy scheduling and time-step simulation to maximize actions before deadlines while the second tests event aggregation, sorting and grouping logic for sessionization.

    Coding & AlgorithmsTechnical Screen
  • TCSMediumData Scientist
    Find duplicates in a list efficiently

    This question evaluates a candidate's ability to design efficient algorithms for duplicate detection, occurrence counting, and preserving first-occurrence order while reasoning about time and space complexity across in-memory, in-place, and streaming data scenarios.

    Coding & AlgorithmsTechnical Screen
  • TargetMediumBackend Engineer
    Find the Closest Candidate String by Edit Distance

    This problem tests the implementation of the Levenshtein distance algorithm (Edit Distance) and the ability to manage tie-breaking logic when comparing multiple strings against a query.

    Coding & AlgorithmsOnline AssessmentDynamic ProgrammingStringsOptimization
  • TekionMediumSoftware Engineer
    Find the Maximum Number of Active Loans

    This problem tests the ability to solve interval overlap challenges using the sweep-line algorithm, specifically handling boundary conditions where a loan ends at the exact time another begins.

    Coding & AlgorithmsTechnical ScreenSweep-lineIntervalsSorting
  • TekionMediumSoftware Engineer
    Maximize Profit with at Most K Transactions

    This problem tests dynamic programming optimization by finding the maximum profit from stock trading with a constraint on the total number of allowed transactions.

    Coding & AlgorithmsTechnical ScreenDynamic ProgrammingAlgorithmsOptimization
  • TemporalMediumSoftware Engineer
    Implement Concurrent Any-True Shot

    This question tests the ability to manage concurrent asynchronous tasks, specifically implementing logic to return the first 'True' result while efficiently cancelling remaining pending tasks.

    Coding & AlgorithmsTechnical ScreenConcurrencyAsyncCancellation
  • TemuEasyData Engineer
    Compute User Login Streaks

    Tests the ability to write a SQL query to identify consecutive daily login streaks from raw event logs, requiring date deduplication, window functions, and streak length aggregation.

    Coding & AlgorithmsTechnical ScreenSQLWindow FunctionsTime Series
  • TemuEasySoftware Engineer
    Find missing rank in a straight

    This question evaluates a candidate's ability to map and manipulate encoded card ranks, reason about consecutive sequences with Ace-as-low or Ace-as-high semantics, and identify a missing element within a constrained set.

    Coding & AlgorithmsOnsite
  • TemuEasySoftware Engineer
    Find next greater element for subset

    This question evaluates understanding of sequence analysis and array-processing competencies, including mapping elements between arrays, index lookup, and designing efficient order-dependent algorithms for the "next greater element" problem.

    Coding & AlgorithmsOnsite
  • TemuMediumSoftware Engineer
    Spiral Order of a Matrix With Blocker Cells That Force Clockwise Turns

    Traverse an m x n matrix clockwise from the outside in, then handle a follow-up where some cells are blockers that the walk must turn away from. Tests careful simulation of direction changes, tracking of visited cells, and a precise rule for when the traversal stops.

    Coding & AlgorithmsTechnical Screen
  • TeslaMediumSoftware Engineer
    Calculate trapped water between elevation bars

    This question evaluates array manipulation, algorithmic optimization, and complexity analysis, specifically the ability to reason about time and space trade-offs and design a linear-time, constant-space approach for computing trapped water.

    Coding & AlgorithmsTechnical Screen
  • TeslaHardMachine Learning Engineer
    Compute suffix sums over waypoints

    This question evaluates a candidate's ability to compute geometric suffix sums over batched 2D trajectories, testing skills in array manipulation, Euclidean distance computation, and runtime-conscious algorithm design within the Coding & Algorithms domain.

    Coding & AlgorithmsTechnical Screen
  • TeslaMediumBackend Engineer
    Compute time to burn tree

    This question evaluates proficiency with tree algorithms, distance computation, and propagation modeling, testing the ability to reason about how a process spreads across parent-child relationships in a tree.

    Coding & AlgorithmsOnsite
  • TeslaHardSoftware Engineer
    Coordinate workers across two exclusive targets

    This problem tests your ability to manage concurrent resources using synchronization primitives, ensuring workers can safely alternate between two exclusive tasks while maintaining thread safety.

    Coding & AlgorithmsTechnical ScreenConcurrencySynchronizationMultithreading
  • TeslaEasySoftware Engineer
    Count the Ways to Decode a Numeric Cipher

    This problem tests your ability to solve a counting problem using dynamic programming by identifying overlapping subproblems in a sequence of numeric mappings.

    Coding & AlgorithmsOnsiteDynamic ProgrammingString ManipulationAlgorithms
  • TeslaMediumSoftware Engineer
    Design a contiguous segment allocator

    This question evaluates a candidate's competency in designing and implementing efficient data structures for interval management, contiguous memory allocation, fragmentation handling, tag-based resource tracking, and algorithmic complexity analysis.

    Coding & AlgorithmsTechnical Screen
  • TeslaMediumSoftware Engineer
    Find latency pairs with minimal difference

    This question evaluates array manipulation, pairwise comparison, and algorithmic efficiency by requiring identification of minimal absolute differences and construction of ordered latency pairs.

    Coding & AlgorithmsTechnical Screen
  • TeslaHardSoftware Engineer
    Flatten a Linked List with Nested Side Branches into One Doubly Linked List

    A linked list whose nodes may each carry one side branch, with branches nested like a binary tree, must be flattened into a single doubly linked list with every branch spliced between its parent and the parent's original successor. It tests pointer rewiring, ordering rules for nested branches, and handling very deep nesting.

    Coding & AlgorithmsOnsite
  • TeslaEasySoftware Engineer
    Generate Per-Position Guess Feedback

    This problem tests your ability to process strings and manage state (character frequency) to determine exact matches versus partial matches, commonly used in word-guessing games.

    Coding & AlgorithmsOnline AssessmentStringHash MapArray
  • TeslaEasyMachine Learning Engineer
    Implement 2D convolution forward pass

    This question evaluates understanding of 2D convolution mechanics and practical low-level tensor manipulation, including kernel shape handling, padding and stride effects, multi-channel input/output interactions, and optional bias integration.

    Coding & AlgorithmsTechnical Screen
  • TeslaHardSoftware Engineer
    Implement a Rollback Key-Value Store

    This problem tests your ability to design a data structure that supports basic key-value operations with an added transactional rollback mechanism using a stack-based approach.

    Coding & AlgorithmsTechnical ScreenData StructuresStackVersioning