Google SWE - Onsite Interview

First

A tree is given in the form of the parent index and value.
tree = [(-1, 'a'), (0, 'b'), (0, 'e'), (1, 'c'), (1, 'd'), (2, 'f'), (2, 'g')] 

• Delete the node at the given index.
• Delete the entire subtree of the node at the given index.

<

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式

e, and a function that returns the probability of 2 students getting caught passing the note. Return the path with the least probability of getting caught from the start to the end.

lalaloopsy 发表于 2025-2-6 01:57
:D
please add rice if you can, I need it for an interview

added, sorry my max is 1, would ve given 100

好人一生平安1！！！

AvaGwen 发表于 2025-2-6 01:14
好人一生平安1！！！

:D
please add rice if you can, I need it for an interview

楼主太强了，能拿这么多面试

请问第二题是不能用额外的数据结构么

wcmr121 发表于 2025-2-14 02:08
请问第二题是不能用额外的数据结构么

yes, you can

I want to ask a clarification question about the first question:

For the first subquestion, if we delete the node at the given index, how do we treat its parent and childen if it's not a leaf node?

Thanks! (already added rice)

匿名用户 发表于 2025-2-20 20:44
I want to ask a clarification question about the first question:

For the first subquestion, if we ...

It's children go to its parent