Glean coding interview
Round 4 of 7 · 15 questions reported
- Format
- Live coding, usually two rounds
- They grade
- Correctness and code quality; test before you call it done
- Heads-up
- Harder than the screen. Reported topics: graph traversal, a Connect Four winner check, event stream processing.
Questions Glean asks in this round 15
- 2048 game with move, merge and game-over detection
- Access log storage with time range queries
- Byte-pair encoding tokenizer
- Document indexing queue assignment
- Kth largest element in two sorted arrays
- Minimum Manhattan distance between X and Y in a matrix
- One-dimensional array with distinct elements
- Reachability in a time-indexed train schedule
- Read text values of web elements with Selenium
- Recipe storage with version history
- Shortest distance between X and Y in a string
- Sort an array with one misplaced element
- Transitive synonym groups from word contexts
- Two-dimensional array with distinct elements
- Word search with a word search II follow-up
About the Glean coding round
What does Glean ask in the coding round?
The most asked: 2048 game with move, merge and game-over detection, Access log storage with time range queries and Byte-pair encoding tokenizer. 15 questions reported in all.
What is the Glean coding round like?
Live coding, usually two rounds. They grade: Correctness and code quality; test before you call it done.