Glean
16 questions · 9 experiences · 1p3a (9) · Other (16)
25 entries
Glean Tech Phone Screen Problem: Document Processing and Node Allocation
Array Compression
Backend Assignment Interview
Basic Calculator
Board Moves
Design Database
Divide Chocolate
Find Synonyms
Frontend Assignment Interview
House Building
Kth Largest
Largest Shape
Minimum Deletions to Balance Parentheses
Sneaky Snack Run
Spaces Between Us
Word Quest
Workload Distribution
Technical Phone Screen at glean: Processor Problem and Python Coding Tips
Glean Frontend Tech Phone Screen Interview Experience
Glean HR Screen Interview for Machine Learning Position
Glean Tech Phone Screen Interview: Find the Kth Largest Number from Two Sorted Arrays
Glean March Onsite Interview Experience for Machine Learning Role
Glean Fulltime Software Engineer Tech Phone Screen Interview Experience
Glean Online Assessment for Software Engineer Position
Glean Tech Phone Screen: Document Indexing Algorithm Challenge
Glean Tech Phone Screen Problem: Document Processing and Node Allocation
Interview Experience
Given m nodes and x documents, input two vectors: the first represents the absolute processing time for each document, and the second represents the processing duration for each document. Iterate through each document, prioritizing the node corresponding to (x_i % m) of that document. If another document is still being processed, continue searching to the right; if no node is found, the document is considered a failure. Find: the number of successfully processed documents and the top k contributing nodes.