← 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, String Manipulation
Location: San Francisco Bay Area
Interview date: 2025-05-12
I had two coding questions in my online assessment.
I had to solve these two coding problems:
Given an integer array arr, find all subarrays where the length of the subarray, n, appears as an element within that subarray.
A circular network is made up of components, represented as a string components. Each component is either 'C' (computing unit) or 'N' (network unit). Determine the minimum number of swaps required to group similar units together in the circular network. (e.g., "CNCN" requires one operation to become "CCNN").