Datadog Interview Guide

Showing 3 of 19 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Datadog. The higher the ranking, the more likely you'll encounter it in a Datadog interview.

Question

Frequency

Difficulty

Coin Change

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.

ArraysDynamic Programming

Very likely

If you have a Datadog interview, it's very likely that you will get this question

Medium

#1. Coin Change

Medium

Given a set of coin denominations and a target amount, find the minimum number of coins needed to reach that amount. You can assume you have an unlimited supply of each coin type.

ArraysDynamic Programming

This question is very likely to be asked in your Datadog interview

Most Common Word

Find the most frequent word in a given paragraph, excluding a list of banned words. Return the most common word after performing case-insensitive comparison and removing punctuation.

ArraysStrings

Very likely

If you have a Datadog interview, it's very likely that you will get this question

Easy

#2. Most Common Word

Easy

Find the most frequent word in a given paragraph, excluding a list of banned words. Return the most common word after performing case-insensitive comparison and removing punctuation.

ArraysStrings

This question is very likely to be asked in your Datadog interview

Maximum Depth of N-ary Tree

Find the maximum depth (number of nodes along the longest path from the root) of an N-ary tree. Each node can have multiple children.

TreesRecursion

Somewhat likely

If you have a Datadog interview, you might get this question

Easy

#3. Maximum Depth of N-ary Tree

Easy

Find the maximum depth (number of nodes along the longest path from the root) of an N-ary tree. Each node can have multiple children.

TreesRecursion