Datadog Software Engineer Interview Questions

There are four rounds in total. Because I also have to work, it's scheduled for two consecutive days. The following content requires a score higher than 188. You can already view it. 1. Coding Reverse

Had an opportunity to interview with Datadog for Senior SDE. Don't remember all exact questions, but all of them were mentioned here, highly recommend to go through all posts where company is mentione

Two classic problems The following content requires a score higher than 188. You can already view it. 1. Given a `bucket_size` and a `bucket_width`, and a set of input numbers, return the number of nu

Hi, I have a system design interview for a junior position at Datadog in 2 days, I haven't ever done such an interview or prepared for it. Can u please share with me any ressource that could be helpfu

LeetCode #211: Design Add and Search Words Data Structure. Difficulty: Medium. Topics: String, Depth-First Search, Design, Trie. Asked at Datadog in the last 6 months.

LeetCode #819: Most Common Word. Difficulty: Easy. Topics: Array, Hash Table, String, Counting. Asked at Datadog in the last 6 months.

LeetCode #1229: Meeting Scheduler. Difficulty: Medium. Topics: Array, Two Pointers, Sorting. Asked at Datadog in the last 6 months.

LeetCode #322: Coin Change. Difficulty: Medium. Topics: Array, Dynamic Programming, Breadth-First Search. Asked at Datadog in the last 6 months.

Hi all, I have a datadog first round interview coming up for a backend role. Does anyone know what kinds of questions and topics to expect for this/what the best way...

Given a paragraph, extract number of words which are repeated and give the output of total number of repetitions. 2. Given a tree, (different class structure was there , but...

Sharing the questions I got for Datadog tech screen and the solution I used in the interview. For both the problems the expectation is to run at least one test...

I have an upcoming Datadog onsite interview loop which includes a React interview, a coding interview, a system design interview plus a project discussion and behavioral interview. Does anyone have...

I have an upcoming Datadog Technical Video Interview for the Software Engineer - Frontend (EMEA) position. The interview includes 40 minutes of coding, featuring two algorithm problems from LeetCode. Does...

I have an upcoming interview with Datadog. Has anyone recently interviewed with them ? What should I expect ?

## Problem "Mado" means window in Japanese. Given an `m x n` integer matrix and a window size `k`, compute the sum of every valid `k x k` submatrix. Return all sums in a result matrix of size `(m-k+1) x (n-k+1)`. Optimize beyond the naive O(m * n * k^2) approach. ```python def mado_sum(matrix: list[list[int]], k: int) -> list[list[int]]: ... ``` ``` Input: matrix = [ [1, 2, 3], [4, 5, 6], [7, 8, 9] ] k = 2 Output: [ [12, 16], # top-left 2x2: 1+2+4+5=12; top-right: 2+3+5+6=16 [24, 28] # bot-left: 4+5+7+8=24; bot-right: 5+6+8+9=28 ] ``` ## Follow-ups 1. Describe the 2D prefix sum technique. What is its time and space complexity? 2. How does your approach handle matrices where `k > min(m, n)`? 3. What if instead of sum you need the maximum value in each window? How does your approach change? 4. Extend to a 3D tensor with window size `k x k x k`. How does the prefix sum generalize?

## Problem Simulate a change (otsuri) dispenser that returns optimal coin combinations for a given amount. ## Tags greedy, dynamic_programming

## Problem Calculate the total size of files in a directory tree, recursively summing nested folder sizes. ## Tags recursion, binary_tree, hash_table

## Problem Determine if a string follows the same pattern as a given word pattern using a bijective character-to-word mapping. ## Likely LeetCode equivalent LC 290 - word-pattern ## Tags hash_table, strings