glean | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Fail
Difficulty: Hard
Interview Process
The interview consisted of a technical phone screen. The candidate was asked to solve a problem related to finding the kth largest element in two sorted arrays. The candidate used a two-pointer approach to solve the problem and wrote test cases. There was a discussion about other potential solutions, including the use of a heap and a divide and conquer approach.
Technical Questions
- Find the kth largest element in two sorted arrays (two pointers)
Tips & Insights
The candidate felt that the overall experience was positive, noting that the interviewer was nice and supportive. However, the candidate recognized the need for more practice with similar problems to improve performance in future interviews.