← 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: 7/10 · Duration: 60 min
Topics: Dynamic Programming, Depth-First Search, Bit Manipulation, Trees, Arrays
Location: San Francisco, CA
Interview date: 2026-03-31
Got offer: False
I completed an online assessment with two coding problems.
The online assessment consisted of two coding problems.
The first problem was a variation of Jump Game where I needed to find the maximum score. The twist was that I could either jump to the next index (i+1) or jump to an index where the last digit is 3 (e.g., 3, 13, 23). I used dynamic programming to solve this.
The second problem involved counting paths in a tree that can form a palindrome. The characters were on the nodes rather than the edges. I had to construct the edges myself based on the given nodeFrom and nodeTo arrays. I used DFS to traverse the tree, but I didn't finish the palindrome check during the assessment. I considered using a bitmask for palindrome detection. I welcome suggestions for a better approach.
LeetCode similar: LeetCode 1696, LeetCode 2791