← 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: Online Assessment · Type: Coding · Difficulty: 6/10 · Duration: 90 min · Interviewer: Unfriendly
Topics: Algorithms, Graphs
Location: Seattle, WA, US
Interview date: 2026-02-15
I completed an online assessment with two coding questions.
The online assessment consisted of two coding questions to be completed in 90 minutes on HackerRank. The browser automatically entered fullscreen, with HackerRank tracking tab switches.
One question was a variation of LeetCode 2389. My initial solution was not optimal and resulted in TLE errors for several hidden test cases due to insufficient speed.
The other question was a variation of LeetCode 2608. It involved graphs and required finding the shortest path for each node to return to itself, calculating the path with the lowest weight. If returning to itself was not possible, the function should return 0.
LeetCode similar: LeetCode 2389, LeetCode 2608