Datadog Interview Questions — 20 DSA Problems

17 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Datadog LeetCode questions for software engineering interviews.

• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Most Common Word (EASY) — Array, Hash Table, String, Counting
• Maximum Depth of N-ary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search
• Design Circular Queue (MEDIUM) — Array, Linked List, Design, Queue
• Valid Word Abbreviation (EASY) — Two Pointers, String
• Meeting Scheduler (MEDIUM) — Array, Two Pointers, Sorting
• Maximum Vacation Days (HARD) — Array, Dynamic Programming, Matrix
• Sliding Window Median (HARD) — Array, Hash Table, Sliding Window, Heap (Priority Queue)
• People Whose List of Favorite Companies Is Not a Subset of Another List (MEDIUM) — Array, Hash Table, String
• Design Add and Search Words Data Structure (MEDIUM) — String, Depth-First Search, Design, Trie
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• House Robber (MEDIUM) — Array, Dynamic Programming
• Check If It Is a Straight Line (EASY) — Array, Math, Geometry
• House Robber II (MEDIUM) — Array, Dynamic Programming
• Binary Search Tree to Greater Sum Tree (MEDIUM) — Tree, Depth-First Search, Binary Search Tree, Binary Tree
• Greatest Common Divisor of Strings (EASY) — Math, String
• Find Words That Can Be Formed by Characters (EASY) — Array, Hash Table, String, Counting
• Odd String Difference (EASY) — Array, Hash Table, String
• Unique Number of Occurrences (EASY) — Array, Hash Table
• Path Sum (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree