Just Eat LeetCode Interview Questions
Practice 47 real coding problems frequently asked in Just Eat technical interviews. Master these questions to ace your next Just Eat software engineering interview.
Top Topics at Just Eat
Ace your Just Eat interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Just Eat Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
N-Queens 100% | HardH | Solve→ |
Minimum Limit of Balls in a Bag 100% | MediumM | Solve→ |
Minimum Path Sum 97% | MediumM | Solve→ |
Clone Graph 95% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 93% | MediumM | Solve→ |
Rotate Image 90% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 90% | MediumM | Solve→ |
Count Unhappy Friends 88% | MediumM | Solve→ |
Zero Array Transformation II 82% | MediumM | Solve→ |
House Robber II 80% | MediumM | Solve→ |
Find Peak Element 80% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 79% | MediumM | Solve→ |
Maximum Units on a Truck 79% | EasyE | Solve→ |
Longest Arithmetic Subsequence of Given Difference 74% | MediumM | Solve→ |
Toeplitz Matrix 73% | EasyE | Solve→ |
Subarray Sum Equals K 70% | MediumM | Solve→ |
Nested List Weight Sum II 70% | MediumM | Solve→ |
High Five 67% | EasyE | Solve→ |
Minimum Operations to Make Character Frequencies Equal 66% | HardH | Solve→ |
Maximum Swap 62% | MediumM | Solve→ |
Find the Celebrity 61% | MediumM | Solve→ |
Combination Sum II 61% | MediumM | Solve→ |
Make String a Subsequence Using Cyclic Increments 58% | MediumM | Solve→ |
Max Stack 56% | HardH | Solve→ |
Reverse Nodes in k-Group 56% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Flood Fill 53% | EasyE | Solve→ |
Alien Dictionary 53% | HardH | Solve→ |
Meeting Rooms II 53% | MediumM | Solve→ |
Valid Number 53% | HardH | Solve→ |
Flatten Binary Tree to Linked List 50% | MediumM | Solve→ |
Valid Word Abbreviation 49% | EasyE | Solve→ |
Minimum Array Sum 46% | MediumM | Solve→ |
Top K Frequent Elements 44% | MediumM | Solve→ |
Palindromic Substrings 39% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 38% | MediumM | Solve→ |
Can Place Flowers 38% | EasyE | Solve→ |
Design HashMap 38% | EasyE | Solve→ |
Minimum Absolute Difference 35% | EasyE | Solve→ |
All Nodes Distance K in Binary Tree 34% | MediumM | Solve→ |
K-diff Pairs in an Array 33% | MediumM | Solve→ |
Diameter of Binary Tree 30% | EasyE | Solve→ |
Spiral Matrix 30% | MediumM | Solve→ |
Minimum Window Substring 26% | HardH | Solve→ |
LRU Cache 26% | MediumM | Solve→ |
Find Median from Data Stream 24% | HardH | Solve→ |
Maximum Profit in Job Scheduling 21% | HardH | Solve→ |
Shortest Word Distance II 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Just Eat ask in interviews?
Just Eat commonly asks 47 coding problems in technical interviews, including N-Queens, Minimum Limit of Balls in a Bag, Minimum Path Sum. The difficulty breakdown is 9 Easy, 29 Medium, and 9 Hard problems.
How should I prepare for a Just Eat coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Just Eat interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Just Eat coding interviews?
Based on our data, Just Eat interviews include 9 Easy (19%), 29 Medium (62%), and 9 Hard (19%) problems.
Ready to ace your Just Eat interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required