← 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: Senior-Level
Round: Phone Screen · Type: Coding · Difficulty: 7/10 · Duration: 60 min · Interviewer: Neutral
Topics: Algorithms
Location: San Francisco Bay Area
Interview date: 2026-01-15
For the 1st coding question, it's similar to leetcode 117
For the 2nd coding question, it's similar to leetcode 1249 and the follow-ups. The follow-up question was that the parentheses were not limited to '()', but also included '[]', '{}', etc. The requirement was to remove the minimum number of invalid pairs and return the string. For example, '([{ab)' should return '(ab)'.
LeetCode similar: LeetCode 117, LeetCode 1249