Recent Google Interview Questions

Nilesh S. - "A daily 10 minute cadence to make a note of the progress and the deliverables for the day, should help ascertain the delivery and to meet schedule the self performing teams need to be on toes to deliver. Time lines need to be revisited end of each day to evalute the impact."See full answer

Pooja G. - "Goal: Maps should reflect reality of places especially with places like hospitals Ecosystem : Maps User Usecases: Daily Commute Explore places Critical situations like emergency - hospital visits, work emergencies, family Businesses using Google Business Profile: Medical & Health Hospitals Clinics Gyms Restaurants Salons Mom & Pop stores, SMB - Retail Enterprises These can be online, physical or both Local guides Downstream usecases for other google products: Google Search Google Gemini "See full answer

Guilherme M. - "Question: An array of n integers is given, and a positive integer k, where k << n. k indicates that the absolute difference between each element's current index (icurrent) and the index in the sorted array (isorted) is less than k (|icurr - isorted| < k). Sort the given array. The most common solution is with a Heap: def solution(arr, k): min_heap = [] result = [] for i in range(len(arr)) heapq.heappush(min_heap, arr[i]) "See full answer

Sam A. - "The distribution of daily search queries per user, as shown in the histogram, can be described as approximately normal (or bell-shaped) with a slight positive skew. Key Characteristics: Shape: The distribution is roughly symmetrical around its center, resembling a bell curve. This indicates that most users perform a moderate number of daily search queries. Central Tendency: The peak of the distribution, representing the highest density of users, appears to be around **8"See full answer

Million D. - "Machine learning software engineer interviews at Google are really challenging. The questions are difficult, specific to Google, and they cover a wide range of topics."See full answer

Karan K. - "2 Approaches: 1) The more intuitive approach is doing a multi-source BFS from all cats and storing the distance of closest cats. Then do a dfs/bfs from rat to bread. Time Complexity: O(mn + 4^L) where L is path length, worst case L could be mn Space Complexity: O(m*n) 2) The first approach should be fine for interviews. But if they ask to optimize it further, you can use Binary Search. Problems like "Finding max of min distance" or "Finding min of max" could be usually solved by BS. "See full answer

Vishnu G. - "1. Understand the "Why" (Deep Dive) - Before jumping to solutions, as a PM needs to precisely understand why users are unhappy. NPS gives us a score, but not the reasons. (0 -4 weeks) Analyze Feedback: Go beyond the score. What are Detractors (0-6) saying? What do Promoters (9-10) love? Qualitative Research:(VOC- voice of the customer) Conduct user interviews, analyze support tickets, and observe product usage. Pinpoint specific pain points (e.g., slow p"See full answer

Syed A. - "Sales Performance Dashboard t for sales leaders to monitor product performance: Sales Performance Dashboard Top-Level Metrics (KPI Summary) Time Filter: [Day] [Week] [Month] [Quarter] [Custom Range] Total Sales Revenue Displays total revenue for the selected period. Units Sold Breakdown by product category and SKU. Average Deal Size Total revenue ÷ Number of deals closed. Conversion Rate _Leads to sales conversion ratio."See full answer

Yizhi T. - "bidirectional tranverse - the nearest seller is either on the left or right of each child 1 - tranverse from left to right，always record the latest seller si, and record the left nearest distance ki - si of current kid into leftarray 2 tranverse from right to left，always record the latest seller si, and record the left nearest distance si-ki of current kid into rightarray 3 find the maximum of the min(leftarray[i], rightarray[i]) of each kid Time complexity: O(N+M) 3 passes of tra"See full answer