Question Details
Problem Find a path through a word graph or transform one word to another in minimum steps, similar to word ladder. Likely LeetCode equivalent Similar to LC 127 Word Ladder but not confirmed as identical. Tags graph, bfs, strings
Full Details
🔒
Unlock all Glean questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a glean interview during the phone round.
It covers the following topics: Strings, Phone, Graph, Coding, Onsite .
More Glean Interview Questions
1p3a
fulltime machine learning onsite interview experience at glean sf office
1p3a
glean software engineer tech phone screen interview experience
InterviewDB
Glean SWE Phone - Array Compression
1p3a
Glean Backend Engineer Interview Experience and Rejection Discussion
1p3a
Glean Tech Phone Screen Problem: Document Processing and Node Allocation