Interview Experience Analysis for Google

Google coding round. Went so bad, that I am considering cancelling the rest of interviews. I talked through a general apporach to solve this, but it did not address one of the edge constraint. Of course did not have time to do a dry run, i did not even have a complete algorithmic pseudocode. the p...

Problem statement: Given an array where each element specifies the parent of a node, determine whether the structure forms a valid tree. Approach: A valid tree must satisfy two conditions: it has exactly n − 1 edges, and there is exactly one simple path from the root to any node. We first build an ...

Q: you are give list of struct blocker; struct { int id; int start; int end; }; and D as range of days for 1 to D; you need to return list of days between 1 to D on which every one is free. ex : {[1,2,3],[2,5,6]} and D = 6 , first is id, second is start last is end; your ans = {1,4} c...

I recently appeared for a Google interview. In Round 1, I was asked two questions. Question 1: Given a CSV string containing a list of ordered products, find the top K most sold products from the data. Question 2: System Design: Design Snapchat. For Question 1, I was able to solve it partially, b...

Sharing my interview experience for the Google Summer Internship role. Hope this helps future interviewees 🚀 # 📞 Round 0: Phone Screen (Resume + Project Discussion) This round was mainly focused on understanding my background and technical exposure. ### **What they asked:** [30 mins discussion]...

Given a list of start times for a task, and length of each task. Each task has the same length, find the min number of cpus needed to minimize the end time of the final task. I suggested binary search from 1 to n where n is the length of the start times, but interviewer said it was too ineficient. A...

Hi Everyone! Recenlty, I gave google interviews for L4 postion. 1st Interview in December, it was a virtual technical round based on array swaps a simple tricky question. I can say it is just above medium. I was able to solve and write the optimal code. Interviewer was very friendly. Self verdict:...

Google 🧠 Arrays & Strings (Very High Frequency) Two Sum – LeetCode 1 Best Time to Buy and Sell Stock – 121 Product of Array Except Self – 238 Longest Substring Without Repeating Characters – 3 Minimum Window Substring – 76 Container With Most Water – 11 Merge Intervals – 56 🔗 Linked List R...

# Phone Screen Given logs when people enter and leave return who was there at each interval input: ``` name | start_time | end_time Abby 10 100 Ben 50 70 Carla 60 90 Bob 110 120 ``` output: ``` start_time | end_time | names 10 ...