Interview Experience
Problem Split a chocolate bar among k people maximizing the minimum sweetness of any piece using binary search. Likely LeetCode equivalent LeetCode 1231 - Divide Chocolate. Tags binary_search, arrays, greedy
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 candidate experience report from a glean interview during the phone round.
It covers the following topics: Phone, Binary Search, Greedy, Coding, Arrays, 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