Question Details
Problem Find the kth largest element in an array using a min-heap of size k. Likely LeetCode equivalent LeetCode 215 - Kth Largest Element in an Array. Tags heap, sorting, arrays
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: Heap, Phone, 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