← 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: Unknown Level
Round: Online Assessment · Type: Coding · Difficulty: 7/10 · Duration: 120 min · Interviewer: Unfriendly
Topics: Arrays, Hashmaps, String Manipulation, Optimization
Location: Menlo Park, CA
Interview date: 2025-12-20
I completed a Codesignal online assessment with four coding problems.
The Codesignal online assessment consisted of these questions:
prices and ratings (1 to 5), where the cost-effectiveness is defined as ratings[i] / prices[i], return the index of the product with the highest cost-effectiveness. If there are ties, return the smallest index.departure_times of bus departure times for the day (e.g., ["11:20","15:00"]) and a current_time (e.g., "14:30"), return how many minutes ago the most recent bus that has already departed left. If no buses have departed before the current time, return -1. If a bus departs exactly at current_time, it is considered not yet departed.puzzle containing only single digits, +, and -, find a path in the matrix that forms a valid expression and returns the maximum value that can be calculated. Rules: (1) Start from any digit cell. (2) Only move right or down, without changing direction in the middle. (3) No consecutive digits or operators in the expression.primary and secondary, and a series of operations operations. There are two types of operations: type0: [0, index, val]: update secondary[index] = val. type1: [1, targetSum]: count the number of pairs (i, j) such that primary[i] + secondary[j] == targetSum. Return the results of all type 1 operations in order. Initially, I used a double loop to count, but then I optimized it by using a hashmap to store the frequencies of elements in secondary. Each update maintains the map, and during the query, I iterate through primary and check for targetSum - primary[i].