← 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: 4/10 · Duration: 60 min · Interviewer: Neutral
Topics: Algorithms
Location: Seattle, WA, US
Interview date: 2026-01-20
Two coding questions were asked during the online assessment.
Two leetcode coding questions
` from typing import List
class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: if not intervals: return []
intervals.sort(key=lambda x: x[0])
merged = [intervals[0]]
for start, end in intervals[1:]:
last_end = merged[-1][1]
if start <= last_end:
merged[-1][1] = max(last_end, end)
else:
merged.append([start, end])
return merged
`
` from collections import Counter
class Solution: def firstUniqChar(self, s: str) -> int: count = Counter(s)
for i, ch in enumerate(s):
if count[ch] == 1:
return i
return -1
`
LeetCode similar: LeetCode 56, LeetCode 387