Farfetch LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Farfetch technical interviews. Master these questions to ace your next Farfetch software engineering interview.
Top Topics at Farfetch
Ace your Farfetch interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Farfetch Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Design Tic-Tac-Toe 100% | MediumM | Solve→ |
Subsets II 95% | MediumM | Solve→ |
K Inverse Pairs Array 87% | HardH | Solve→ |
Next Permutation 86% | MediumM | Solve→ |
Longest Repeating Character Replacement 86% | MediumM | Solve→ |
Product of Array Except Self 85% | MediumM | Solve→ |
Integer to Roman 84% | MediumM | Solve→ |
Container With Most Water 84% | MediumM | Solve→ |
Regular Expression Matching 80% | HardH | Solve→ |
Two Sum II - Input Array Is Sorted 77% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 74% | MediumM | Solve→ |
Check If N and Its Double Exist 74% | EasyE | Solve→ |
Make String a Subsequence Using Cyclic Increments 74% | MediumM | Solve→ |
Roman to Integer 73% | EasyE | Solve→ |
Pow(x, n) 73% | MediumM | Solve→ |
Basic Calculator II 72% | MediumM | Solve→ |
Plus One 65% | EasyE | Solve→ |
Merge Two Sorted Lists 62% | EasyE | Solve→ |
Reverse Words in a String 62% | MediumM | Solve→ |
Single Number 62% | EasyE | Solve→ |
Gas Station 60% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 60% | MediumM | Solve→ |
Missing Ranges 60% | EasyE | Solve→ |
Flatten Binary Tree to Linked List 57% | MediumM | Solve→ |
The Earliest Moment When Everyone Become Friends 54% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
K-diff Pairs in an Array 52% | MediumM | Solve→ |
Basic Calculator 47% | HardH | Solve→ |
Pascal's Triangle 45% | EasyE | Solve→ |
Shortest Path in Binary Matrix 44% | MediumM | Solve→ |
Minimum Array Sum 44% | MediumM | Solve→ |
Find Longest Self-Contained Substring 42% | HardH | Solve→ |
House Robber 42% | MediumM | Solve→ |
Coin Change 40% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 39% | EasyE | Solve→ |
3Sum 38% | MediumM | Solve→ |
Remove All Adjacent Duplicates In String 37% | EasyE | Solve→ |
Palindrome Number 37% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 31% | HardH | Solve→ |
Linked List Cycle 29% | EasyE | Solve→ |
Zigzag Conversion 29% | MediumM | Solve→ |
Fraction to Recurring Decimal 26% | MediumM | Solve→ |
Zero Array Transformation II 25% | MediumM | Solve→ |
LFU Cache 23% | HardH | Solve→ |
Valid Sudoku 22% | MediumM | Solve→ |
Course Schedule 21% | MediumM | Solve→ |
Number of Islands 20% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Farfetch ask in interviews?
Farfetch commonly asks 46 coding problems in technical interviews, including Design Tic-Tac-Toe, Subsets II, K Inverse Pairs Array. The difficulty breakdown is 11 Easy, 29 Medium, and 6 Hard problems.
How should I prepare for a Farfetch coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Farfetch interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Farfetch coding interviews?
Based on our data, Farfetch interviews include 11 Easy (24%), 29 Medium (63%), and 6 Hard (13%) problems.
Ready to ace your Farfetch interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required