Problem database last updated: June 20, 2025
8 problems · 6 Easy, 2 Medium, 0 Hard · Ranked #170 of 458
6 Easy
75% · avg 23%
2 Medium
25% · avg 59%
0 Hard
0% · avg 18%
Based on 8 reported problems, Criteo interviews are easier than average - only 0% Hard compared to 18% across all companies.
Compared to the industry average, Criteo puts unusual emphasis on binary-search (37.5% of problems, 4.2x the industry average), two-pointers (25% of problems, 1.8x the industry average), sorting (25% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (75%), binary-search (37.5%), hash-table (25%), two-pointers (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Intersection of Two Arrays Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any... | Easy | Very Likely | arrayhash-tabletwo-pointers | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Flood Fill You are given an image represented by an m x n grid of integers image, where image[i][j] represents the pixel value of the image. You are also given three integ... | Easy | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Random Pick with Weight You are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index. | Medium | Very Likely | arraymathbinary-search | Solve |
Ransom Note Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise. | Easy | Likely | hash-tablestringcounting | Solve |
Merge Sorted Array You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num... | Easy | Likely | arraytwo-pointerssorting | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Likely | arraybinary-search | Solve |
Intersection of Two Arrays
SolveGiven two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the result in any...
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Flood Fill
SolveYou are given an image represented by an m x n grid of integers image, where image[i][j] represents the pixel value of the image. You are also given three integ...
Random Pick with Weight
SolveYou are given a 0-indexed array of positive integers w where w[i] describes the weight of the ith index.
Ransom Note
SolveGiven two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise.
Merge Sorted Array
SolveYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num...
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Criteo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Criteo interviews focus heavily on array, binary-search, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Criteo interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Criteo has been reported to ask 8 distinct coding problems. The most common topics are array, binary-search, hash-table. 6 are Easy difficulty, 2 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 8 reported problems, Criteo interviews are easier than average - only 0% Hard compared to 18% across all companies. 25% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, binary-search, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Criteo coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Criteo interview with AIarrow_forward
