← 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: 6/10 · Duration: 60 min · Interviewer: Neutral
Topics: Arrays, Algorithms, Two-dimensional Grid, IP Addresses
Location: San Francisco Bay Area
Interview date: 2025-09-08
I completed an online assessment with two coding questions.
I completed an online assessment for an internship. The assessment consisted of two coding problems:
Given arrays of IP addresses with their respective timestamps, find all IP addresses that appear more than k times within any t-second window. If no such IP addresses exist, return an empty array.
example: n = 3 ip = [1,2,1] timestamp = [6,10,15] k = 1 t = 10 return [1]
In a 2-d grid, you start at the coordinate(startX, startY) and want to reach the target coordinate(endX, endY), you are given a string called directions of length n, which can contain the following characters:
Implement a function to calculate the earliest time required to reach from start to end. At the ith second, you can perform either of the two moves: move one unit in the direction as specified by the character directions[i] or stay where you are. The function should return the earliest time(an integer) at which you can reach the target position. If you cannot reach it within the given time n, return -1
example directions: "WWNNSSE" startX = 1 startY = -1 endX = -1 endY = -1 return 6