Question 1

Coin Change — Datadog Interview Question

Accepted Answer

"Coin Change" is a medium difficulty problem asked at Datadog interviews. It covers the following topics: Array, Dynamic Programming, Breadth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/coin-change

Question 2

Most Common Word — Datadog Interview Question

Accepted Answer

"Most Common Word" is a easy difficulty problem asked at Datadog interviews. It covers the following topics: Array, Hash Table, String, Counting. You can practice it on LeetCode: https://leetcode.com/problems/most-common-word

Question 3

Maximum Depth of N-ary Tree — Datadog Interview Question

Accepted Answer

"Maximum Depth of N-ary Tree" is a easy difficulty problem asked at Datadog interviews. It covers the following topics: Tree, Depth-First Search, Breadth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/maximum-depth-of-n-ary-tree

Question 4

Design Circular Queue — Datadog Interview Question

Accepted Answer

"Design Circular Queue" is a medium difficulty problem asked at Datadog interviews. It covers the following topics: Array, Linked List, Design, Queue. You can practice it on LeetCode: https://leetcode.com/problems/design-circular-queue

Question 5

Valid Word Abbreviation — Datadog Interview Question

Accepted Answer

"Valid Word Abbreviation" is a easy difficulty problem asked at Datadog interviews. It covers the following topics: Two Pointers, String. You can practice it on LeetCode: https://leetcode.com/problems/valid-word-abbreviation

Question 6

Meeting Scheduler — Datadog Interview Question

Accepted Answer

"Meeting Scheduler" is a medium difficulty problem asked at Datadog interviews. It covers the following topics: Array, Two Pointers, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/meeting-scheduler

#	Question Title	Difficulty	Frequency	Topics
1	Coin Change	MEDIUM	100.0	ArrayDynamic ProgrammingBreadth-First Search
2	Most Common Word	EASY	91.6	ArrayHash TableString+1
3	Maximum Depth of N-ary Tree	EASY	89.4	TreeDepth-First SearchBreadth-First Search
4	Design Circular Queue	MEDIUM	86.9	ArrayLinked ListDesign+1
5	Valid Word Abbreviation	EASY	86.9	Two PointersString
6	Meeting Scheduler	MEDIUM	82.4	ArrayTwo PointersSorting
7	Maximum Vacation Days	HARD	68.7	ArrayDynamic ProgrammingMatrix
8	Sliding Window Median	HARD	68.7	ArrayHash TableSliding Window+1
9	People Whose List of Favorite Companies Is Not a Subset of Another List	MEDIUM	68.7	ArrayHash TableString
10	Design Add and Search Words Data Structure	MEDIUM	65.0	StringDepth-First SearchDesign+1

Explore 450+ Companies

Companies

Datadog

Want to see more?

Datadog Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Datadog

Want to see more?

Datadog Interview Questions

Ai Assistant Kas