Criteo LeetCode Interview Questions
Practice 47 real coding problems frequently asked in Criteo technical interviews. Master these questions to ace your next Criteo software engineering interview.
Top Topics at Criteo
Ace your Criteo interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Criteo Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
First Missing Positive 100% | HardH | Solve→ |
Expression Add Operators 98% | HardH | Solve→ |
4Sum 96% | MediumM | Solve→ |
Maximum Units on a Truck 96% | EasyE | Solve→ |
Can Place Flowers 87% | EasyE | Solve→ |
Valid Palindrome II 81% | EasyE | Solve→ |
Minimum Operations to Make Character Frequencies Equal 80% | HardH | Solve→ |
Remove Nth Node From End of List 80% | MediumM | Solve→ |
Analyze User Website Visit Pattern 79% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 77% | MediumM | Solve→ |
Rotting Oranges 77% | MediumM | Solve→ |
Missing Number 76% | EasyE | Solve→ |
Word Break 75% | MediumM | Solve→ |
Construct String With Repeat Limit 74% | MediumM | Solve→ |
Word Pattern II 74% | MediumM | Solve→ |
Valid Parentheses 72% | EasyE | Solve→ |
Kth Largest Element in an Array 71% | MediumM | Solve→ |
Nested List Weight Sum 71% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 71% | MediumM | Solve→ |
Find Peak Element 66% | MediumM | Solve→ |
Gas Station 64% | MediumM | Solve→ |
Recyclable and Low Fat Products 64% | EasyE | Solve→ |
Remove All Adjacent Duplicates in String II 64% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 63% | MediumM | Solve→ |
High Five 63% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Pascal's Triangle 63% | EasyE | Solve→ |
Unique Paths 61% | MediumM | Solve→ |
LFU Cache 61% | HardH | Solve→ |
Search Suggestions System 58% | MediumM | Solve→ |
Bus Routes 54% | HardH | Solve→ |
Reverse Integer 53% | MediumM | Solve→ |
Nested List Weight Sum II 52% | MediumM | Solve→ |
Count Unhappy Friends 52% | MediumM | Solve→ |
Longest Repeating Character Replacement 51% | MediumM | Solve→ |
Walls and Gates 50% | MediumM | Solve→ |
Find K Closest Elements 49% | MediumM | Solve→ |
Maximum Beauty of an Array After Applying Operation 48% | MediumM | Solve→ |
First Unique Character in a String 46% | EasyE | Solve→ |
Design HashMap 43% | EasyE | Solve→ |
Add Two Numbers 39% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 39% | HardH | Solve→ |
Palindromic Substrings 39% | MediumM | Solve→ |
Spiral Matrix 36% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 33% | HardH | Solve→ |
Shortest Palindrome 33% | HardH | Solve→ |
Logger Rate Limiter 26% | EasyE | Solve→ |
Reverse Linked List 20% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Criteo ask in interviews?
Criteo commonly asks 47 coding problems in technical interviews, including First Missing Positive, Expression Add Operators, 4Sum. The difficulty breakdown is 12 Easy, 27 Medium, and 8 Hard problems.
How should I prepare for a Criteo coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Criteo interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Criteo coding interviews?
Based on our data, Criteo interviews include 12 Easy (26%), 27 Medium (57%), and 8 Hard (17%) problems.
Ready to ace your Criteo interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required