← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Level: Intern
Round: Onsite · Type: Coding · Difficulty: 7/10 · Duration: 60 min · Interviewer: Unfriendly
Location: Mountain View, CA
Interview date: 2026-02-15
Got offer: False
I was given a black box function called run() that takes test cases as input. I was given a list of test cases, where two specific test cases, if input together to run(), would cause a failure. If only one or neither of these test cases is input, it will pass. The task was to identify these two conflicting test cases. I was able to come up with an O(n log n) solution during the onsite interview.
The coding question I received was:
Given a black box function:
python def run(testcases): #Implementation Hidden pass
I was given a list of test cases, where two specific test cases, if input together to run(), would cause a failure. If only one or neither of these test cases is input, it will pass. The task was to identify these two conflicting test cases.
similar to https://leetcode.com/discuss/post/5087592/google-l3-phone-interview-find-pair-by-a-rt9t/
I solved it with O(n log n) time complexity.