Automattic LeetCode Interview Questions
Practice 46 real coding problems frequently asked in Automattic technical interviews. Master these questions to ace your next Automattic software engineering interview.
Top Topics at Automattic
Ace your Automattic interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Automattic Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Reverse Nodes in k-Group 100% | HardH | Solve→ |
K Closest Points to Origin 85% | MediumM | Solve→ |
Number of Islands 79% | MediumM | Solve→ |
Binary Search Tree Iterator 79% | MediumM | Solve→ |
Identify the Largest Outlier in an Array 78% | MediumM | Solve→ |
Check Completeness of a Binary Tree 77% | MediumM | Solve→ |
Palindrome Number 76% | EasyE | Solve→ |
Evaluate Division 76% | MediumM | Solve→ |
Is Subsequence 75% | EasyE | Solve→ |
Dot Product of Two Sparse Vectors 74% | MediumM | Solve→ |
Nested List Weight Sum 72% | MediumM | Solve→ |
Fraction to Recurring Decimal 71% | MediumM | Solve→ |
Design an Array Statistics Tracker 71% | HardH | Solve→ |
Subsets II 69% | MediumM | Solve→ |
Permutations 69% | MediumM | Solve→ |
Missing Ranges 68% | EasyE | Solve→ |
Make String a Subsequence Using Cyclic Increments 67% | MediumM | Solve→ |
Shortest Palindrome 66% | HardH | Solve→ |
Maximum Area Rectangle With Point Constraints I 64% | MediumM | Solve→ |
Find Leaves of Binary Tree 63% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 62% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 58% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 57% | HardH | Solve→ |
Sort Colors 53% | MediumM | Solve→ |
Reveal Cards In Increasing Order 51% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
K Inverse Pairs Array 50% | HardH | Solve→ |
Maximum Swap 49% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 46% | MediumM | Solve→ |
Flip Columns For Maximum Number of Equal Rows 44% | MediumM | Solve→ |
High Five 44% | EasyE | Solve→ |
Buildings With an Ocean View 42% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 38% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 37% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 36% | EasyE | Solve→ |
Find Peak Element 36% | MediumM | Solve→ |
Same Tree 31% | EasyE | Solve→ |
Alien Dictionary 29% | HardH | Solve→ |
Add Two Integers 29% | EasyE | Solve→ |
Binary Tree Vertical Order Traversal 28% | MediumM | Solve→ |
String Compression 28% | MediumM | Solve→ |
Simplify Path 27% | MediumM | Solve→ |
Zigzag Conversion 26% | MediumM | Solve→ |
Trapping Rain Water 25% | HardH | Solve→ |
Analyze User Website Visit Pattern 25% | MediumM | Solve→ |
Sort Integers by The Power Value 24% | MediumM | Solve→ |
Word Break 24% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Automattic ask in interviews?
Automattic commonly asks 46 coding problems in technical interviews, including Reverse Nodes in k-Group, K Closest Points to Origin, Number of Islands. The difficulty breakdown is 7 Easy, 32 Medium, and 7 Hard problems.
How should I prepare for a Automattic coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Automattic interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Automattic coding interviews?
Based on our data, Automattic interviews include 7 Easy (15%), 32 Medium (70%), and 7 Hard (15%) problems.
Ready to ace your Automattic interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required