Glassdoor LeetCode Interview Questions
Practice 41 real coding problems frequently asked in Glassdoor technical interviews. Master these questions to ace your next Glassdoor software engineering interview.
Top Topics at Glassdoor
Ace your Glassdoor interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Glassdoor Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Coin Change 100% | MediumM | Solve→ |
Merge Two Sorted Lists 89% | EasyE | Solve→ |
Identify the Largest Outlier in an Array 87% | MediumM | Solve→ |
Reveal Cards In Increasing Order 84% | MediumM | Solve→ |
Merge k Sorted Lists 84% | HardH | Solve→ |
Top K Frequent Elements 81% | MediumM | Solve→ |
Kth Smallest Element in a BST 80% | MediumM | Solve→ |
Course Schedule 77% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 76% | MediumM | Solve→ |
Flatten Binary Tree to Linked List 75% | MediumM | Solve→ |
Valid Parentheses 72% | EasyE | Solve→ |
Valid Sudoku 70% | MediumM | Solve→ |
Take Gifts From the Richest Pile 69% | EasyE | Solve→ |
Rotting Oranges 68% | MediumM | Solve→ |
Koko Eating Bananas 66% | MediumM | Solve→ |
Search in Rotated Sorted Array 65% | MediumM | Solve→ |
Reverse Integer 61% | MediumM | Solve→ |
Two Best Non-Overlapping Events 60% | MediumM | Solve→ |
Rotate Image 55% | MediumM | Solve→ |
Longest Increasing Subsequence 55% | MediumM | Solve→ |
Bus Routes 49% | HardH | Solve→ |
Making A Large Island 48% | HardH | Solve→ |
K Inverse Pairs Array 44% | HardH | Solve→ |
Find K Pairs with Smallest Sums 44% | MediumM | Solve→ |
Rank Transform of a Matrix 43% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
All Nodes Distance K in Binary Tree 43% | MediumM | Solve→ |
Design Hit Counter 42% | MediumM | Solve→ |
Valid Palindrome III 41% | HardH | Solve→ |
Populating Next Right Pointers in Each Node 38% | MediumM | Solve→ |
The Earliest Moment When Everyone Become Friends 38% | MediumM | Solve→ |
String Compression 37% | MediumM | Solve→ |
Word Break II 36% | HardH | Solve→ |
Minimum Array Sum 33% | MediumM | Solve→ |
Find Leaves of Binary Tree 33% | MediumM | Solve→ |
Goat Latin 31% | EasyE | Solve→ |
Maximum Area Rectangle With Point Constraints I 30% | MediumM | Solve→ |
Minimum Operations to Make Character Frequencies Equal 28% | HardH | Solve→ |
Maximum Size Subarray Sum Equals k 26% | MediumM | Solve→ |
Subsets 25% | MediumM | Solve→ |
LFU Cache 24% | HardH | Solve→ |
Min Stack 24% | MediumM | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Glassdoor ask in interviews?
Glassdoor commonly asks 41 coding problems in technical interviews, including Coin Change, Merge Two Sorted Lists, Identify the Largest Outlier in an Array. The difficulty breakdown is 4 Easy, 28 Medium, and 9 Hard problems.
How should I prepare for a Glassdoor coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Glassdoor interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Glassdoor coding interviews?
Based on our data, Glassdoor interviews include 4 Easy (10%), 28 Medium (68%), and 9 Hard (22%) problems.
Ready to ace your Glassdoor interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required