D

Datadog

20 questions tracked17 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 20 of 20 questions

1
MediumCoin Changeβœ“ Our Solution
100
ArrayDynamic ProgrammingBreadth-First Search
2
EasyMost Common Wordβœ“ Our Solution
92
ArrayHash TableStringCounting
3
EasyMaximum Depth of N-ary Treeβœ“ Our Solution
89
TreeDepth-First SearchBreadth-First Search
4
MediumDesign Circular Queueβœ“ Our Solution
87
ArrayLinked ListDesignQueue
5
EasyValid Word Abbreviation
87
Two PointersString
6
MediumMeeting Scheduler
82
ArrayTwo PointersSorting
7
HardMaximum Vacation Days
69
ArrayDynamic ProgrammingMatrix
8
HardSliding Window Medianβœ“ Our Solution
69
ArrayHash TableSliding WindowHeap (Priority Queue)
9
MediumPeople Whose List of Favorite Companies Is Not a Subset of Another Listβœ“ Our Solution
69
ArrayHash TableString
10
MediumDesign Add and Search Words Data Structureβœ“ Our Solution
65
StringDepth-First SearchDesignTrie
11
HardBinary Tree Maximum Path Sumβœ“ Our Solution
65
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
12
MediumHouse Robberβœ“ Our Solution
65
ArrayDynamic Programming
13
EasyCheck If It Is a Straight Lineβœ“ Our Solution
55
ArrayMathGeometry
14
MediumHouse Robber IIβœ“ Our Solution
55
ArrayDynamic Programming
15
MediumBinary Search Tree to Greater Sum Treeβœ“ Our Solution
47
TreeDepth-First SearchBinary Search TreeBinary Tree
16
EasyGreatest Common Divisor of Stringsβœ“ Our Solution
47
MathString
17
EasyFind Words That Can Be Formed by Charactersβœ“ Our Solution
47
ArrayHash TableStringCounting
18
EasyOdd String Differenceβœ“ Our Solution
47
ArrayHash TableString
19
EasyUnique Number of Occurrencesβœ“ Our Solution
47
ArrayHash Table
20
47
TreeDepth-First SearchBreadth-First SearchBinary Tree