Gave Interview for Google Intern Oncampus
Company: Google
Role: SWE Intern
Stipend: 1.23LPM
Location: Bangalore, Hyderabad, Pune
College: DTU (DCE)
Branch: CSE
No of Rounds: 2
Duration: 45 mins
Both rounds were Technical.
Round-1: Given a graph with n nodes, where one node is infected. You are given a start node. Return a vector of size n where each index indicates the shortest distance between start node to ith node of the graph.
Follow-Up: What if multiple nodes are infected in the given graph.
Round-2: Given a sorted array of integers, find the number of unique integers in the given array.
Follow-Up: If the number of unique integers in the array is very less than the size of the array, then find the mathematical formula for Time complexity.
Verdict: Accepted
Some Tips Specific to Google Interviews: