Level: Mid-Level
Round: Full Journey · Type: Multiple Types · Difficulty: 6/10 · Duration: 240 min · Interviewer: Unfriendly
Topics: Coding, Algorithms, Arrays, Intervals, Sliding Window, Hash Table, Behavioral Questions, Data Structures, System Design
Location: Mountain View, CA
Interview date: 2025-12-13
Question: Interval problem similar to Meeting Rooms III. I clarified the problem, gave an optimal solution, fixed a bug during dry run, and discussed time/space complexity. The interviewer was satisfied.
Question: Given an array, determine if subarrays within specified intervals alternate between odd and even numbers. I preprocessed the array to mark odd/even adjacency and then checked for consecutive same-parity elements within the intervals.
Question: Given an array nums, find the shortest subarray containing at least k distinct integers. I used a sliding window and frequency hash table for an O(n) solution.
Question: Discussion of personal projects and internship experiences, along with behavioral questions such as future plans and why I want to work at Google.