← 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: Mid-Level
Round: Phone Screen · Type: Coding · Difficulty: 8/10 · Duration: 60 min · Interviewer: Neutral
Topics: Arrays, Math
Location: Seattle, WA, US
Interview date: 2025-11-30
This was a phone screen focused on coding. I had to solve two hard-level coding problems.
I was given two hard-level coding questions. The first question was LeetCode 829.
The second question (which I couldn't find the exact match for) was as follows:
Given an array of numbers, e.g., [30, 31, 31], return the number of sub-arrays where each number in the sub-array has the same digit sum as the other numbers in the original array.
For example, [4998, 4999, 4999] is valid because the digit sum of 4998 is 4+9+9+8 = 30, and the digit sum of 4999 is 4+9+9+9 = 31. The question asks to return the number of possible such sub-arrays.
LeetCode similar: LeetCode 829