Coding & Algorithms interview questions

Showing 2791–2820 of 3276 results

• Transit Wallet Ledger: Expiring Vouchers, Zone Fees and RefundsHard

  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.

  StripeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate KYC CSV RecordsMedium

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

  StripeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Validate transactions with risk rules and reportingMedium

  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.

  StripeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Verify business accounts with progressive KYC rulesMedium

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

  StripeSoftware EngineerCoding & AlgorithmsTechnical Screen
• Weekly Maintenance Windows Across Time Zones: Find Usable SlotsMedium

  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.

  StripeSoftware EngineerCoding & AlgorithmsOnsite
• Build Event Notification EngineMedium

  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.

  StubHubSoftware EngineerCoding & AlgorithmsOnsite
• Design Composable Event RecommendationsMedium

  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.

  StubHubSoftware EngineerCoding & AlgorithmsOnsite
• Implement a Composable Event Recommendation EngineMedium

  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.

  StubHubSoftware EngineerCoding & AlgorithmsOnsite
• Solve substring and access-log problemsMedium

  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.

  SumologicSoftware EngineerCoding & AlgorithmsOnsite
• Compute max planes shot and session countEasy

  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.

  SupioSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find duplicates in a list efficientlyMedium

  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.

  TCSData ScientistCoding & AlgorithmsTechnical Screen
• Find the Closest Candidate String by Edit DistanceMedium

  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.

  TargetBackend EngineerCoding & AlgorithmsOnline Assessment
• Find the Maximum Number of Active LoansMedium

  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.

  TekionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Maximize Profit with at Most K TransactionsMedium

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

  TekionSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement Concurrent Any-True ShotMedium

  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.

  TemporalSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute User Login StreaksEasy

  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.

  TemuData EngineerCoding & AlgorithmsTechnical Screen
• Find missing rank in a straightEasy

  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.

  TemuSoftware EngineerCoding & AlgorithmsOnsite
• Find next greater element for subsetEasy

  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.

  TemuSoftware EngineerCoding & AlgorithmsOnsite
• Spiral Order of a Matrix With Blocker Cells That Force Clockwise TurnsMedium

  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.

  TemuSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate trapped water between elevation barsMedium

  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.

  TeslaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute suffix sums over waypointsHard

  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.

  TeslaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Compute time to burn treeMedium

  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.

  TeslaBackend EngineerCoding & AlgorithmsOnsite
• Coordinate workers across two exclusive targetsHard

  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.

  TeslaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count the Ways to Decode a Numeric CipherEasy

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

  TeslaSoftware EngineerCoding & AlgorithmsOnsite
• Design a contiguous segment allocatorMedium

  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.

  TeslaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Find latency pairs with minimal differenceMedium

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

  TeslaSoftware EngineerCoding & AlgorithmsTechnical Screen
• Flatten a Linked List with Nested Side Branches into One Doubly Linked ListHard

  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.

  TeslaSoftware EngineerCoding & AlgorithmsOnsite
• Generate Per-Position Guess FeedbackEasy

  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.

  TeslaSoftware EngineerCoding & AlgorithmsOnline Assessment
• Implement 2D convolution forward passEasy

  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.

  TeslaMachine Learning EngineerCoding & AlgorithmsTechnical Screen
• Implement a Rollback Key-Value StoreHard

  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.

  TeslaSoftware EngineerCoding & AlgorithmsTechnical Screen