← 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: Junior-Level
Round: Online Assessment · Type: Coding · Difficulty: 5/10 · Duration: 75 min · Interviewer: Neutral
Topics: Algorithms, Arrays
Location: Seattle, WA, US
Interview date: 2026-02-20
I completed an online assessment consisting of two medium-level coding problems.
The assessment was on HackerRank and lasted 75 minutes. There were two questions:
Find the shortest subarray size with at least K distinct characters.
Given an array of n integer prices in non-decreasing order, and q queries to process. For each query, I was given a starting position (pos) and an amount of money (amount). The goal was to determine the maximum number of products I could buy without exceeding the available amount. For each price, I could only buy one product. I had to return the answers for each query in an array.