Dataminr coding interview
questions, leaked.
2 problems reported across recent Dataminr interviews. Top patterns: array, math, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Dataminr's coding assessment is lean but punishing. Two problems, one medium and one hard, and you're done. Array manipulation dominates the problem set, so you'll need to handle indexing, ranges, and transformations without hesitation. The hard problem mixes math and sorting into an array challenge, while the medium leans on matrix simulation. If you freeze mid-problem on the live assessment, StealthCoder runs invisibly and surfaces a working solution in seconds. You won't have time to grind five dozen similar problems before your OA, so precision on these specific patterns matters.
Top problems at Dataminr
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Maximum Building Height | HARD | 100.0 | 37% | Array · Math · Sorting |
| 02 | Spiral Matrix III | MEDIUM | 100.0 | 84% | Array · Matrix · Simulation |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Dataminr OA. The proctor cannot see it. Screen share cannot detect it. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know.
Get StealthCoder- array2 · 100%
- math1 · 50%
- sorting1 · 50%
- matrix1 · 50%
- simulation1 · 50%
Both problems root themselves in array operations, which tells you where to focus first. Maximum Building Height combines array logic with math and sorting constraints, so you need fluency in sorting edge cases and mathematical optimization. Spiral Matrix III sits at medium difficulty but involves spatial reasoning and simulation, which is a different cognitive load. The hard-to-medium split is brutal because you get no warm-up problem. You'll step straight into complexity. Drill sorting algorithms applied to non-standard data and matrix traversal patterns before your OA. If the hard problem's mathematical constraints trip you up live, StealthCoder is your hedge, pulling a correct solution from the assessment platform in real time while the proctor sees only your screen.
Companies with similar patterns
If you prepped for Dataminr, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Dataminr.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made by a working FAANG engineer who treats the OA the way companies treat hiring: as a game with rules you should know. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Dataminr interview FAQ
How much should I focus on array problems for Dataminr?+
Array techniques appear in both problems and are the foundation of the assessment. Spend 60% of your prep time on array indexing, slicing, and in-place transformations. The other 40% should cover sorting, math optimization, and matrix traversal, since those appear as modifiers in the main problems.
Is the medium problem actually easier than the hard one?+
Spiral Matrix III involves 2D spatial reasoning and simulation logic, which is more conceptually complex than it looks on paper. The hard problem (Maximum Building Height) is harder, but don't assume the medium is a warm-up. Both require clean implementation under time pressure.
What should I study first for Dataminr's OA?+
Start with sorting algorithms and how to apply them to arrays of custom objects or constraints. Then move to matrix traversal and spiral patterns. Leave math optimization for last, but don't skip it. The hard problem won't solve itself.
Do I need to know simulation techniques?+
Yes. Spiral Matrix III is fundamentally a simulation problem where you move through a 2D grid and record values. Practice step-by-step grid traversal where direction changes and boundary logic matter. This is different from standard sorting or searching.
What happens if I can't solve the hard problem mid-OA?+
If you blank on Maximum Building Height during the assessment, you've got maybe 15 to 20 minutes left to attempt it. StealthCoder solves it invisibly and surfaces a working solution so you can at least submit something correct. That's the safety net for the pattern you didn't have time to drill.