← Back to Directory

Glean

Mid-sized

Screna has 10 Glean interview write-ups. The most reported round is the technical phone screen (8).

10 interview notes · updated Jun 2026

Glean·Frontend Engineer·Technical Phone Screen

Jun 2026
Interviewed for a frontend role at Glean and got a coding question straight out of a game mechanic. It was more involved than I expected for a frontend screen.
  • Implement the tile-sliding and merging logic from the 2048 game for all four swipe directions on a 4x4 grid, including the constraint that each tile can only merge once per move.

“I've played 2048 before so the rules weren't foreign to me, but actually coding it cleanly is a different thing.”

View Post

Glean·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineer role at Glean and got hit with Word Search (LC 79). Short and to the point, nothing too surprising.
  • Given a 2D board of characters and a target word, determine whether the word exists in the grid by searching through adjacent cells (horizontally or vertically connected, no reuse of cells).

“Classic backtracking problem.”

View Post

Glean·Machine Learning Engineer·Onsite - System Design / Architecture

Jun 2026
Did an ML design round at Glean for an MLE role. One question, 60 minutes, focused entirely on computing employee-to-employee distance. Not a ton to say but it was a solid problem that made me think harder than I expected.
  • Design a system to compute the distance between any two employees in an organization.

“This sounds like a graph problem at first and I went straight to org chart traversal, but the more we talked the more it became clear they probably wanted something richer than shortest path on a hierarchy tree.”

View Post

Glean·Software Engineer·Technical Phone Screen

May 2026
Glean SWE interview that came down to a single algorithmic problem on sorted arrays. The question had real depth to it, more than I expected for what looked like a straightforward merge problem on the surface.
  • Given two sorted arrays of integers, find the k-th largest element across both arrays combined (where k=1 is the maximum). How would you approach this, and what are the tradeoffs between different solutions?

“I went straight for the merge-from-the-back approach, which works fine at O(m+n), but they pushed me on whether I could do better.”

View Post

Glean·Software Engineer·Technical Phone Screen

Apr 2026
Glean SWE interview that was essentially a full game implementation problem. Not a leetcode grind session, more of a design-your-way-through-it situation.
  • Implement the 2048 game. Follow-up: how do you detect when the game is over?

“The core implementation took a while to get right because merging tiles in a direction sounds trivial until you're actually coding it and realize you need to handle the order of merges carefully so tiles don't double-merge in one move.”

View Post

Glean·Machine Learning Engineer·Technical Phone Screen

Apr 2026
Coding screen for an MLE role at Glean. The problem was graph-flavored but dressed up as a train scheduling puzzle, which threw me off a bit at first. Decent interview overall, felt like they wanted to see how you think about reachability and complexity rather than just code.
  • You're given a train schedule as a list of trains, where each train is a list of station names and the index represents arrival time. Implement a function that returns whether a passenger can travel from a start station to an end station, given that passengers can transfer between trains at shared stations even if they arrive at different times (i.e. they can wait). Follow-ups include discussing complexity, finding shortest travel time with wait, and finding all reachable stations from a given start.

“My first instinct was to just do a DFS over stations, but the waiting mechanic made me second-guess myself for a minute.”

View Post

Glean·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineer role at Glean. The main question was Word Search II, which is already a pretty well-known hard problem, so not a huge surprise but still stressful under pressure.
  • Given a 2D board of characters and a list of words, find all words that exist in the board. Words can be constructed from sequentially adjacent cells (horizontally or vertically neighboring), and the same cell may not be used more than once per word.

“This is the trie plus DFS backtracking problem.”

View Post

Glean·Machine Learning Engineer·Take-home Assignment

Apr 2026
Glean gave me a 75-minute AI-assisted coding assignment for an ML Engineer role. The task was interesting on paper but I spent way too much of that time just trying to understand what Cursor had even generated.
  • Build a Wikipedia crawler that prioritizes unvisited first-letters of page titles across the alphabet, then falls back to random crawling once all 26 letters are covered. Must respect a rate limit. You can use AI coding tools like Cursor or Claude Code.

“The core idea is clever.”

View Post

Glean·Software Engineer·Technical Phone Screen

Apr 2026
Glean coding round, one meaty simulation problem that took up the whole session. Not the usual leetcode grind, which I appreciated, but it also meant there was nowhere to hide if you didn't know your heap stuff cold.
  • Build a priority-based job scheduler that processes a stream of jobs, each with an arrival time, duration, and priority. The processor is non-preemptive, so once a job starts it runs to completion. Return the completion order and each job's start time, finish time, and wait time.

“The non-preemptive constraint is the key thing to get right early.”

View Post

Glean·Software Engineer·Technical Phone Screen

Mar 2026
Glean SWE interview with a search/autocomplete coding problem that looked straightforward but had a memory constraint twist that changed the whole approach. One question, but it had some depth to it.
  • You're given a static list of suggestion objects, each with an ngram string, a department ID, and a score. Implement a function that takes a query string, a user's department ID, and a number k, then returns the top k suggestions where the query is a prefix of the ngram and the department matches, ranked by score descending. The catch: memory is tight since the suggestion list already takes up roughly half the server's available memory, so your solution needs to account for that.

“My first instinct was to just filter and sort on every call, which works but is obviously terrible for latency.”

View Post