Criteo coding interview
questions, leaked.
8 problems reported across recent Criteo interviews. Top patterns: array, hash table, binary search. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Criteo's coding assessment is deceptively simple on the surface: 8 problems total, 6 of them easy, 2 medium, zero hard. Don't let that fool you. The real test is speed and pattern recognition under live pressure. Arrays dominate the problem set, appearing in 6 out of 8 problems, often paired with hash tables, binary search, or two-pointer techniques. You'll see problems like Two Sum and Intersection of Two Arrays, which seem trivial until the proctor's timer starts and your brain goes blank. If you hit a wall mid-assessment, StealthCoder runs invisibly during your screen share and surfaces a working solution in seconds, giving you the safety net to move on and finish strong.
Top problems at Criteo
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Intersection of Two Arrays | EASY | 100.0 | 76% | Array · Hash Table · Two Pointers |
| 02 | Random Pick with Weight | MEDIUM | 81.2 | 48% | Array · Math · Binary Search |
| 03 | Two Sum | EASY | 81.2 | 56% | Array · Hash Table |
| 04 | Flood Fill | EASY | 81.2 | 66% | Array · Depth-First Search · Breadth-First Search |
| 05 | Valid Parentheses | EASY | 72.2 | 42% | String · Stack |
| 06 | Merge Sorted Array | EASY | 72.2 | 53% | Array · Two Pointers · Sorting |
| 07 | Ransom Note | EASY | 72.2 | 65% | Hash Table · String · Counting |
| 08 | Search in Rotated Sorted Array | MEDIUM | 72.2 | 43% | Array · Binary Search |
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 Criteo OA. The proctor cannot see it. Screen share cannot detect it. Made by a working Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE.
Get StealthCoder- array6 · 75%
- hash table3 · 38%
- binary search3 · 38%
- two pointers2 · 25%
- sorting2 · 25%
- string2 · 25%
- math1 · 13%
- prefix sum1 · 13%
- randomized1 · 13%
- depth first search1 · 13%
The topic distribution tells you exactly where to focus: array manipulation is non-negotiable, so nail Two Sum, Intersection of Two Arrays, and Merge Sorted Array until you can code them asleep. Hash tables show up 3 times, binary search 3 times, and two-pointers twice, so those patterns will surface repeatedly, sometimes in the same problem. Flood Fill and Search in Rotated Sorted Array are medium-difficulty curveballs designed to catch candidates who only drilled easy problems. Random Pick with Weight combines math, binary search, and prefix sums, which is the kind of hybrid that trips people up in live conditions. The bulk of the assessment is easy, which means execution speed is what separates passes from rejections. If you freeze on a hash-table edge case or forget the binary-search pivot logic, StealthCoder is your invisible hedge, delivering a working pattern instantly so you can copy, adapt, and move on.
Companies with similar patterns
If you prepped for Criteo, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Criteo.
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 Amazon engineer who got tired of watching qualified friends bomb OAs they'd solve cold in an IDE. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Criteo interview FAQ
Should I drill all 8 problems or focus on the easy ones first?+
Start with the 6 easy problems and get them to muscle memory. Two Sum, Merge Sorted Array, and Intersection of Two Arrays will likely appear or closely resemble what you see live. Once you can write those without thinking, move to the 2 medium problems: Random Pick with Weight and Search in Rotated Sorted Array. Those are the curveballs.
How much time should I spend on arrays vs. hash tables vs. binary search?+
Arrays come up in 6 problems, so treat that as your primary focus. Hash tables appear 3 times, often paired with arrays. Binary search hits 3 times but usually in harder variants. Spend 60% of drill time on arrays, 25% on hash tables and two-pointers, 15% on binary search patterns.
Is two-pointers worth memorizing if it only shows up twice?+
Yes. Two-pointers is baked into Merge Sorted Array and Intersection of Two Arrays, both easy problems. It's also foundational for understanding how problems like Search in Rotated Sorted Array work. Spend one session getting comfortable with the pattern, then move on.
What makes Flood Fill and Search in Rotated Sorted Array harder than the others?+
Flood Fill requires DFS or BFS thinking and matrix navigation, which many candidates skip during light prep. Search in Rotated Sorted Array needs binary search with a mental pivot point calculation. Both punish candidates who only drilled hash-table and two-pointer problems. Practice both.
Is Random Pick with Weight something I need to master, or can I skip it?+
It appears once in the problem set. It combines math, prefix sums, and binary search, so it's low-frequency but high-friction. If you're confident in binary search and basic math, drill it once. If time is tight, know that it exists and accept it as a possible medium-difficulty trap on the live OA.