← 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: Intern
Round: Online Assessment · Type: Coding · Difficulty: 7/10 · Duration: 60 min · Interviewer: Neutral
Topics: Arrays, Heaps, Hash Tables, String Manipulation
Location: San Francisco Bay Area
Interview date: 2026-03-31
Got offer: False
The online assessment consisted of two coding problems.
I applied online for a software engineering internship. The assessment had two questions.
Question 1:
Given an integer array array and a number of requests n. Each request involves taking the maximum and minimum values from the array, adding them to a result, and decrementing the maximum value by one. I needed to use a max heap and min heap to efficiently maintain the maximum and minimum values and return the sum of each request.
Question 2:
Given a string containing only uppercase letters A-Z, I needed to iterate through each prefix of the string from left to right and determine if the string could be divided into an integer number of substrings with the same letter frequency as the prefix. If not, return 1. I was told that using just gcd (greatest common divisor) is not sufficient and it needs to be combined with a hash table to record each prefix's signature. I failed to solve this problem and did not pass the assessment.