← Back to Directory

Datadog

Large Enterprises

Screna has 12 Datadog interview write-ups. The most reported round is the technical phone screen (8).

12 interview notes · updated Jun 2026

Datadog·Software Engineer·Technical Phone Screen

Jun 2026
Datadog software engineer interview with a coding problem around bucketing sorted integers. Pretty straightforward problem but the edge case around the overflow bucket is where people probably trip up.
  • Given a sorted array of integers, a bucket width, and a number of buckets, distribute the values into buckets and return the count per bucket. The last bucket is a catch-all for anything that overflows the regular range.

“The linear scan approach is pretty clean once you realize you can just do v divided by bucket_width and clamp to the last index.”

View Post

Datadog·Machine Learning Engineer·Onsite - System Design / Architecture

Jun 2026
Datadog ML engineer round focused entirely on one meaty system design problem about monitoring web server latency at scale. No fluff, no behavioral warmup, just straight into the weeds on alerting pipelines and on-call policy design. Walked out unsure if I covered enough of the human-in-the-loop angle.
  • Design a system to monitor latency across dozens of web servers (each reporting average response time every second), detect degraded performance, and decide when to page an on-call engineer. Include human-in-the-loop controls like ack, snooze, and re-page intervals, and discuss how you'd tune the policy to balance alert fatigue against missed regressions.

“This is a big question and I did not scope it well at first.”

View Post

Datadog·Software Engineer·Technical Phone Screen

Jun 2026
Datadog SWE interview with a tree reconstruction problem that sounds straightforward until you actually sit down and think through the edge cases. The orphan root condition tripped me up more than I expected.
  • Given an unordered list of span dictionaries (each with a span_id, parent_id, start_time, and possibly other fields), reconstruct a list of tree-structured traces. A span is a root if its parent_id is None or its parent_id doesn't appear in the input. Children at each node must be sorted by start_time. Return the list of root spans, each with a nested children field representing its subtree.

“The 'orphan root' part is where I lost a minute.”

View Post

Datadog·Software Engineer·Onsite - System Design / Architecture

May 2026
System design round at Datadog for a software engineer role. The whole thing was basically a deep dive into designing YouTube from scratch, covering everything from upload pipelines to recommendations. Pretty broad scope for a single session.
  • Design a video platform like YouTube. Walk through how you'd handle video upload, transcoding, storage, streaming, and core social features like comments, likes, and subscriptions.
  • How would you design the search functionality for a video platform at scale?
  • Walk me through how you'd build a recommendation system for videos, from candidate generation to final ranking.
  • How would you handle non-functional requirements like global low-latency playback, high availability, and petabyte-scale video storage?

“This is a monster of a question and I think I underestimated the scope at first.”

View Post

Datadog·Software Engineer·Technical Phone Screen

May 2026
Datadog AI coding round for a software engineer role. The main task was building a Snowflake query client and it went smoothly, but the follow-ups on secrets and batch processing added some real substance to what could've been a pretty easy session.
  • Implement a query client that connects to Snowflake, exposing a method to start a query and another to check its status.
  • How would you handle secret management for database credentials in this client?
  • How would you extend this client to support batch query processing?

“Knocked this out pretty fast with AI assistance.”

View Post

Datadog·Software Engineer·Onsite - System Design / Architecture

May 2026
Did a system design round at Datadog for a software engineer role. Just one question but it had enough surface area to go in a lot of directions.
  • Design a system that can identify or find a specific photo within a continuous data stream.

“This is the kind of question where you can spiral fast if you don't nail down what 'find' actually means up front.”

View Post

Datadog·Machine Learning Engineer·Technical Phone Screen

May 2026
Datadog ML engineer interview where the coding task was to connect to the Snowflake API, run a query, and check its status. AI tools were allowed, which made it feel less like a gotcha and more like a real work simulation.
  • Using the Snowflake API, write code to submit a query and retrieve its execution status.
  • If the query returns more data than you can handle, what would you do?

“Having AI tools available was a bit of a double-edged thing.”

View Post

Datadog·Frontend Engineer·Onsite - System Design / Architecture

May 2026
Datadog-style system design round for a frontend role, two interviewers in the room, fully open-ended with no system specified upfront. The whole thing hinges on pacing yourself well enough to actually reach the optimization discussion at the end, which apparently is the part they care about most.
  • Design a system in the Datadog domain (e.g. a metrics ingestion pipeline, time-series storage, dashboarding, or alerting system). The specific system is left for you to define and drive.
  • How would you handle time-series data compression and downsampling in your storage layer?
  • Walk through how you would optimize your design given the constraints you've established. What are the biggest bottlenecks and how do you address them?

“Two interviewers and no prompt.”

View Post

Datadog·Software Engineer·Technical Phone Screen

May 2026
Datadog SWE interview with a log matching problem that started simple but got pretty involved once they pushed on the optimization angle. The follow-up is where the real interview happened.
  • Given a stream of log records and a collection of queries (each query being a set of words), how would you determine which logs match which queries? A log matches a query if every word in the query appears in the log.
  • How do you efficiently reset per-log state between log records when using the reverse index approach, and how does complexity scale with the size of the query set?
  • How would you handle this system at scale, with very large query sets and continuously streaming logs?

“The naive approach is obvious: for each log-query pair, check if every query word is in the log.”

View Post

Datadog·Software Engineer·Technical Phone Screen

Apr 2026
Datadog software engineer interview with a data structures problem that started simple and then got more interesting with a trie follow-up. Pretty focused, just the one problem but it had real depth to it.
  • Design a data structure that stores a set of prefixes, then given a list of strings, output only those strings that match any stored prefix.

“Started with a HashMap and just checked every possible prefix length for each input string.”

View Post