Google | Phone | Min Cost (Max Path) from Root to Leaf

BS in CS
5 yoe

Recently went through Google interview process and got asked this question

https://leetcode.com/discuss/interview-question/411228/google-phone-screen-min-time-to-wet-tree

It is a bit cryptic so took me a while and couple hints but I answered and wrote code for dfs.

Probably wasn't good enough as I was rejected. This sucks bad as last time I was atleast able to go to on-site.

Anyways, my recruiter wants me to try again in few months so I'll keep grinding and try again then.

Cheers and be safe

Comments (1)