Compass LeetCode Interview Questions
Practice 37 real coding problems frequently asked in Compass technical interviews. Master these questions to ace your next Compass software engineering interview.
Top Topics at Compass
Ace your Compass interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Compass Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Binary Tree Maximum Path Sum 100% | HardH | Solve→ |
Reverse Words in a String 84% | MediumM | Solve→ |
Remove Letter To Equalize Frequency 83% | EasyE | Solve→ |
Counting Bits 83% | EasyE | Solve→ |
Word Pattern II 82% | MediumM | Solve→ |
Remove Duplicates from Sorted Array 82% | EasyE | Solve→ |
Search in Rotated Sorted Array 78% | MediumM | Solve→ |
Number of Distinct Islands 75% | MediumM | Solve→ |
Find Longest Self-Contained Substring 75% | HardH | Solve→ |
Merge Strings Alternately 74% | EasyE | Solve→ |
Valid Palindrome III 74% | HardH | Solve→ |
Jump Game II 71% | MediumM | Solve→ |
Friends Of Appropriate Ages 70% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 69% | MediumM | Solve→ |
Same Tree 69% | EasyE | Solve→ |
Goat Latin 68% | EasyE | Solve→ |
Construct Quad Tree 68% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 68% | HardH | Solve→ |
Fraction to Recurring Decimal 65% | MediumM | Solve→ |
3Sum 64% | MediumM | Solve→ |
Maximum Number of Occurrences of a Substring 57% | MediumM | Solve→ |
Basic Calculator 55% | HardH | Solve→ |
Frequency of the Most Frequent Element 55% | MediumM | Solve→ |
Maximum Units on a Truck 54% | EasyE | Solve→ |
Design an Array Statistics Tracker 52% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Kth Smallest Element in a BST 49% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 42% | MediumM | Solve→ |
Remove Duplicates from Sorted Array II 40% | MediumM | Solve→ |
Find the Celebrity 40% | MediumM | Solve→ |
Clone Graph 39% | MediumM | Solve→ |
Combination Sum II 36% | MediumM | Solve→ |
Asteroid Collision 34% | MediumM | Solve→ |
Remove Nth Node From End of List 34% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 32% | MediumM | Solve→ |
Custom Sort String 24% | MediumM | Solve→ |
Largest Number 24% | MediumM | Solve→ |
Random Pick with Weight 21% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Compass ask in interviews?
Compass commonly asks 37 coding problems in technical interviews, including Binary Tree Maximum Path Sum, Reverse Words in a String, Remove Letter To Equalize Frequency. The difficulty breakdown is 7 Easy, 24 Medium, and 6 Hard problems.
How should I prepare for a Compass coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Compass interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Compass coding interviews?
Based on our data, Compass interviews include 7 Easy (19%), 24 Medium (65%), and 6 Hard (16%) problems.
Ready to ace your Compass interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required