Datadog Coding Interview Questions

Showing 9 problems of 100

• #67hardsometimes asked

  67. Word Ladder

  Find the shortest transformation sequence from beginWord to endWord, changing one letter at a time, using only words from a dictionary. Datadog uses this as a BFS-on-implicit-graph question — same pattern they use for shortest-path queries on dynamic service topologies.

  Solve →
• #90hardsometimes asked

  90. Median of Two Sorted Arrays

  Find the median of two sorted arrays in O(log(min(m,n))). Datadog asks this for the partition-based binary search — same shape as quantile estimation over two pre-aggregated metric blocks.

  Solve →
• #91hardsometimes asked

  91. Regular Expression Matching

  Implement regex matching with '.' and '*'. Datadog asks this as a hard DP — same shape as their tag-pattern engine that matches user-specified wildcards against high-cardinality metric names.

  Solve →
• #93hardsometimes asked

  93. Reverse Nodes in k-Group

  Reverse linked list nodes in groups of K, leaving the tail intact if it's shorter than K. Datadog uses this to test deep pointer manipulation — same shape as in-place chunk reversal in their reverse-time-order query optimization.

  Solve →
• #94hardrarely asked

  94. Substring with Concatenation of All Words

  Find all starting indices of substrings that are a concatenation of each word exactly once. Datadog asks this for the hash-based sliding window — same shape as multi-tag-pattern detection on a log stream.

  Solve →
• #95hardrarely asked

  95. Longest Valid Parentheses

  Find the length of the longest valid (well-formed) parentheses substring. Datadog uses this for the stack-tracking-indices trick — same shape as their balanced-segment detector on partially-corrupted log streams.

  Solve →
• #96hardrarely asked

  96. Sudoku Solver

  Solve a 9x9 Sudoku via backtracking. Datadog uses this as a deep constraint-satisfaction question — same shape as their resource-allocation solver that fills a constrained schedule.

  Solve →
• #97hardsometimes asked

  97. First Missing Positive

  Find the smallest missing positive integer in O(n) time and O(1) space. Datadog uses this for the index-as-hash trick — same shape as their dense-key occupancy check across a metric-ID space.

  Solve →
• #99hardrarely asked

  99. N-Queens

  Place N queens on an N x N board such that none attack each other. Datadog uses this as the canonical backtracking + constraint encoding question — same shape as multi-dim CSP they use for capacity placement.

  Solve →