12 questions · from 4 interviews
Glean interview questions
Every question candidates reported from their Glean interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.
Glean coding and DSA questions
- 01
Find Earliest Train Route
- 02
Path to Snack Avoiding Bosses
You are given a matrix where each cell can have values: D - your desk, B - Boss's desk (can be multiple), S - Snack (can be multiple), . - empty, - wall. Find if it's possible to get a snack from your desk without disturbing any boss.
- 03
Path to Snack Avoiding Bosses with Noise
If the snack has a noise value K, which represents the number of empty spaces the noise can travel through, find if it's possible to get the snack without disturbing any boss' through noise.
- 04
Maximum Noise K for Path to Snack
Find the maximum value of K for which you can get the snack without disturbing any B's.
- 05
Find Kth Largest Element in M Sorted Arrays
Given m arrays of size n , how do you find the kth largest element?
Medium · From Glean | New Grad Interview Full Loop Experience
- 06
Sort Array with One Out-of-Place Element
You're given a sorted array with one element that is out of place. Write a function that sorts the array.
Medium · From Glean | New Grad Interview Full Loop Experience
- 07
Shortest Distance from All Buildings
LeetCode Problem 317: Shortest Distance from All Buildings.
Hard · From Glean | New Grad Interview Full Loop Experience
Glean system design questions
- 01
Design a Web Crawler with Host‑specific QPS Limits
Design a web crawler where each host has a specific QPS (queries per second) value that must be respected.
- 02
Low-Level Design: Table Module from Scratch
A 5-part low-level design problem to code up a table module from scratch. I started with the basics of adding rows and columns, then moved on to joins.
Hard · From Glean | New Grad Interview Full Loop Experience
Glean other questions
- 01
Write Selenium code to retrieve values of two elements
Write Selenium code to return the test value of two elements, completing within 2-3 lines of code.
- 02
Testing strategy for a leaf‑counting system
Describe how you would test a system that counts the leaves of a large tree.
- 03
Proof: Median as Best Balancer for Array
Prove why the median is the best value for balancing an array. This was a math proof question, with no coding involved.
Hard · From Glean | New Grad Interview Full Loop Experience
Glean interview questions FAQ
What questions are asked in Glean interviews?
Candidates reported 12 distinct questions across 4 Glean interviews. 7 coding and DSA questions, 2 system design questions, 3 other questions.
How difficult are Glean interview questions?
Of the questions candidates rated, 0% were easy, 40% medium and 60% hard.