Coding & Algorithms interview questions

Showing 961–990 of 3276 results

• Evaluate an arithmetic expressionMedium

  This problem tests the ability to parse and evaluate arithmetic expressions involving addition, subtraction, multiplication, and division, requiring careful handling of operator precedence and parsing multi-digit integers.

  DockerSoftware EngineerCoding & AlgorithmsTechnical Screen
• Collapse runs of adjacent anagrams in a word listMedium

  Given a list of lowercase words, repeatedly delete any word that is an anagram of the word immediately before it, and return what remains in its original order. The task tests anagram comparison, reasoning about how repeated deletions interact, and producing a unique, order-preserving result.

  DocuSignSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compress Consecutive Integer RangesEasy

  Tests array manipulation, sorting, deduplication, and range-grouping logic to produce a compact string representation of consecutive numbers.

  DocuSignSoftware EngineerCoding & AlgorithmsOnsite
• Find maximum island sum and required indicesMedium

  This question evaluates grid-based graph traversal and connected-component aggregation skills, including handling positive and negative cell values, tie-breaking by row-major indices, and computing maximum component sums.

  DocuSignSoftware EngineerCoding & AlgorithmsTechnical Screen
• Implement a key-value CRUD storeMedium

  This question evaluates understanding of core data structures, API design, complexity analysis, and edge-case handling for an in-memory key–value CRUD store, and falls under the Coding & Algorithms domain while testing both practical implementation skills and conceptual reasoning about time/space trade-offs.

  DocuSignSoftware EngineerCoding & AlgorithmsOnsite
• Calculate Courier EarningsMedium

  This question evaluates algorithmic problem-solving with emphasis on temporal interval aggregation, handling overlapping events, and applying conditional rate multipliers under specified business rules.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate Daily Driver PayHard

  This question evaluates event-driven time-interval processing, interval-overlap arithmetic, rate computation, and robustness to malformed, duplicate, or unordered events when aggregating a driver's pay from a day's log.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Calculate Driver PaymentsMedium

  Implement a payout calculation system for delivery drivers by deduplicating order logs, merging overlapping active-time intervals, and computing base pay, delivery bonuses, and tips.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Compute Courier Delivery PayEasy

  This question tests the ability to handle time intervals and calculate cumulative earnings based on overlapping delivery pay rates.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Differences Between Catalog TreesMedium

  This question evaluates proficiency in tree algorithms and hierarchical data comparison, including simultaneous traversal, subtree sizing, key-based node identity, and time/space complexity reasoning, and is commonly asked to assess algorithmic problem-solving and trade-off analysis when comparing structured datasets.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Driver Pay with Double-Pay WindowsMedium

  This question evaluates a candidate's ability to perform interval arithmetic and aggregation for time-based pay computations, including handling overlapping intervals, half-open boundaries, capped double-pay application, and special-case handling for canceled orders.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute Nearest Destination DistancesEasy

  This problem tests your ability to use Multi-Source Breadth-First Search (BFS) to find the distance from every empty cell to the nearest destination in a grid.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute cart total with best promotionMedium

  This question evaluates numerical reasoning for monetary calculations, handling of multiple promotion types, precision and rounding considerations, and edge-case handling such as empty carts and clamping totals within the Coding & Algorithms domain.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Compute dasher pay with peak-hour queryMedium

  This question tests the ability to handle overlapping time intervals and perform weighted calculations based on time-based pay multipliers.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Compute delivery times on a gridMedium

  This question evaluates understanding of graph traversal and shortest-path algorithms, grid-based pathfinding, and data structure selection for representing sparse or large grids within the Coding & Algorithms domain.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute earliest arrival in time-gridMedium

  This question evaluates algorithmic problem-solving and pathfinding skills on grid-based graphs, focusing on modeling time-dependent traversal constraints and reasoning about efficient search and supporting data structures.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute nearest dashmart and busiest assignmentsMedium

  Compute nearest dashmart and busiest assignments 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.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute nearest dashmart distances for queriesMedium

  This question evaluates a candidate's understanding of graph traversal and shortest-path computation on grids, spatial reasoning about obstacles and sources, and the ability to analyze algorithmic scalability and complexity when answering many queries.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Compute nearest-exit distances in a gridMedium

  Compute nearest-exit distances in a grid 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.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Count changed nodes between two menu treesHard

  This problem tests recursive tree traversal and hierarchical diffing strategies to identify structural and content changes between two versions of a menu tree.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Count changed nodes in N-ary treesMedium

  This question evaluates understanding of N-ary tree data structures, structural comparison of hierarchical versions, and the ability to reason about time and space complexity when detecting added, deleted, value-changed, or reparented nodes.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Debug a driver assignment bugMedium

  This question evaluates debugging, root-cause analysis, unit/integration test design, observability, and system-resilience competencies within the Coding & Algorithms domain, emphasizing practical skills in reproducing failures, isolating defects, and implementing targeted fixes.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Debug and refactor a legacy moduleMedium

  This question evaluates debugging, refactoring, naming and exception handling, input validation, code structure, and concurrency-safety design skills within a legacy codebase, requiring both hands-on code changes and higher-level reasoning about immutability, confinement, synchronization, and concurrent data structures.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Debug round-robin, DashMap, and simple cacheMedium

  This question evaluates skills in concurrent programming and stateful selection logic (round-robin load balancing), data structure invariants and debugging (custom hash map hashing vs equality, collision resolution, resizing and iterator correctness), simple in-memory caching strategies with TTL or size-based eviction, and unit test design.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Debug using logs and allocate tasksMedium

  This question evaluates a candidate's skill in log-driven debugging, production incident investigation, and cross-functional task allocation, covering competencies such as structured and contextual logging, correlation identifiers, noise reduction, minimal reproducibility, feature-flagged isolation, triage coordination, hypothesis tracking, root-cause confirmation, regression prevention, and blameless postmortems. It is commonly asked to assess operational troubleshooting and teamwork under production uncertainty within the Coding & Algorithms category, testing practical application of debugging techniques alongside conceptual understanding of incident management and process-level coordination.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Design a hierarchical path registryMedium

  Design a hierarchical path registry 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.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Design a single-machine LRU cacheMedium

  This question evaluates a candidate's ability to design an efficient in-memory LRU cache and apply concurrency control, covering eviction semantics, capacity management, key updates, and synchronization for thread safety.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen
• Design dasher-to-order assignment algorithmMedium

  This question evaluates a candidate's skills in real-time algorithm design and systems thinking for dynamic matching and optimization, including scalability, time/space complexity analysis, and handling partial or delayed information.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Design dynamic connectivity with alive nodesMedium

  This question evaluates understanding of dynamic graph data structures, connectivity algorithms, state management for node activation/deactivation, complexity analysis, and concurrent operation considerations.

  DoorDashSoftware EngineerCoding & AlgorithmsOnsite
• Design hierarchical path store with create/set/get/removeMedium

  This question evaluates a candidate's competency in hierarchical data structures, path parsing, API semantics, error signaling, complexity analysis, and unit testing for implementing a UNIX-style key-value path store.

  DoorDashSoftware EngineerCoding & AlgorithmsTechnical Screen