← 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: Full Journey · Type: Multiple Types · Difficulty: 6/10 · Duration: 240 min · Interviewer: Unfriendly
Topics: Arrays, Intervals, Sliding Window, Hash Tables, Behavioral Questions, Data Structures, Algorithms
Location: Mountain View, CA
Interview date: 2025-12-14
Question: Interval-related question similar to the Meeting Rooms III problem. I clarified the requirements, provided an optimal solution, fixed a bug during dry run, and discussed time and space complexity. The interviewer was satisfied with my response.
Question: Implement multiple interval checks on an array to determine if the subarray within a given interval has alternating odd and even numbers. My solution involved pre-processing with an auxiliary array to mark the consistency of adjacent element parity, which allowed for constant-time determination for each query.
Question: Given an array nums, find the shortest continuous subarray that contains at least k distinct integers. If no such subarray exists, return -1. I described the brute force solution first, then provided an optimized solution using a sliding window and frequency hash table.
Question: Discussion of personal projects and internship experiences, as well as behavioral questions like future plans and why I want to work at Google. No coding in this round.