← 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: Junior-Level
Round: Onsite · Type: Multiple Types · Difficulty: 6/10 · Duration: 120 min · Interviewer: Neutral
Topics: Algorithms, Data Structures, Trie, Binary Search, Topological Sort
Location: San Francisco Bay Area
Interview date: 2026-01-31
Question: Given two arbitrary subsequences, determine if they belong to the same parent sequence. The follow-up involved extending this to n subsequences, which I approached using topological sort, but I ran out of time.
Question: The problem was similar to LeetCode 1268, solvable with a trie. The follow-up involved discussing solutions without using a trie, which I solved using binary search. I completed both questions quickly.
In late January, I had an onsite interview.
Round 1: The interviewer barely interacted, only nodding or shaking his head. The question was: given any two subsequences, determine if they belong to the same parent sequence. The follow-up was to extend this to n subsequences. I used topological sort, but I ran out of time. I finished writing the code and did one dry run before the round ended without further testing.
Round 2: My interviewer was great to communicate with. The question was similar to LeetCode 1268, and I solved it using a trie. The follow-up was to discuss solutions without using a trie, and I used binary search. I finished both questions quickly, with about 10 minutes remaining.
LeetCode similar: LeetCode 1268