Hi Leetcode community,
Sharing my google L3 Interview Experience

Phone Screening[Sept 2024]

There are n number of routers connected to each other at some distances. A source router src will receive a message and broadcast it to all routers within specified distance d. Return True/False weather destination router des got the message or not. (Simple BFS algorithm).

Given: router names and their distances, src, des and d.

FollowUp: Message goes only to first nearest router. Return True/False for the same question.

Round 1 [Oct 2024]

Given a tree with each node having a weight. Find min weight required to disconnect all leaf nodes.

eg: Weight: A-B: 2 A-C: 4 B-D: 2 B-E: 1
(A has 2 child nodes: B and C. B has 2 child nodes: D and E)

Ans: 6 (Cut node C and Node B)

eg: Weight: A-B: 3 A-C: 4 B-D: 1 B-E: 1
(A has 2 child nodes: B and C. B has 2 child nodes: D and E)

Ans: 6 (Cut node C, Node D and Node E)

No follow up ques as got nervous while solving this and messed up time complexity.

Round 2 [Oct 2024]

Compute: add(sub(-5,10),mul(5,pow(2,5)))
(Used stack)
No follow up ques as this coding only took time.

Round 3 [Oct 2024]

Googlyness

Round 4 [Oct 2024]

Given inbuilt function query(L,R) which returns 1 if subarray(L,R) has digit '1' else returns 0.
You are not given the binary array arr. return a list of indexes having digit '1'
N= number of digit '1' in array arr= 10^5
M=size of arr= 2^62-1

eg: (The array is: 011000100) return: 2,3,7

Note: Array arr is not given just utilize function query(L,R) to find these indexes.

FollowUp:

In this case, query(L,R) function return number of digit '1' in the subarray(L,R).

You are Given N,k. Return N/k number of subintervals each having k number of digit '1'.

eg: (Let the array arr be: 01100010100)
return: [0,4] and [5,10]
or [0,3] and [4,10]