Glassdoor Coding Interview Questions
26 Glassdoor coding interview problems with full optimal solutions — 17 easy, 7 medium, 2 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Glassdoor interviewer values, and a FAQ section.
Showing 2 problems of 26
- #22hardfoundational
22. Merge K Sorted Lists
Glassdoor's feed merges sorted review streams from multiple data sources in real time — this k-way merge problem is their hard-tier benchmark for candidates who know when to reach for a min-heap instead of naive repeated comparisons.
- #23hardfoundational
23. Median of Two Sorted Arrays
Glassdoor publishes salary medians from two independently sorted data warehouses — getting that number in O(log n) time, not O(n), is the kind of constraint engineers there live with, which is why this binary-search-on-partitions problem appears in their hard-tier loops.