Tech IndustryJul 4, 2019
SkedGoUzlM34

Advanced algorithms in google interview

What should one prep for google interview in terms of advanced algorithms and ds? Anyone can recommend a list of "should know" knowledge? Failed Google on-site recently. Got asked a question related to segment tree. Yoe 3, tc: shit

Goldman Sachs BePostive Jul 4, 2019

Which level?

SkedGo UzlM34 OP Jul 4, 2019

L3/l4

Goldman Sachs BePostive Jul 4, 2019

I don’t think they generally ask these advanced DS. I haven’t heard anyone asked a DS more advanced than a Trie! I have tons of friends who work at Google and another bunch who recently interviewed at google! Probably, you had a hard luck! P.S.- I cleared Google on-site last week! I have 3 YOE!

New
tey Jul 4, 2019

YOE?

SkedGo UzlM34 OP Jul 4, 2019

3

Microsoft SwitchJobs Jul 4, 2019

Usually, on advanced algorithms, they don't ask hard questions. Most probably, plain implementation of segment tree would be sufficient. I mean lazy propagation and variations of segment tree won't be asked. It's always good to be equipped with Segment tree, Binary Index tree and Tries. To be extra cautious, suffix trees and arrays. Other than this, if asked, Good Luck! Bdw, how were your other rounds? What type of questions were asked?

SkedGo UzlM34 OP Jul 4, 2019

Thanks. I believe other rounds are fine, not great. It starts with a medium problem, I arrive at the optimal solution then code it. No time for follow ups

Google jjack24 Jul 4, 2019

Seriously doubt that using a segment tree was the easiest / intended solution. Can you elaborate on the question? Usually the hardest questions you will get from G will be Union Find, DP, or maybe some complicated bit manipulation.

Google jjack24 Jul 4, 2019

Yeah that question is very plausible, I admit I was wrong.

Alibaba Group vXQh35 Jul 4, 2019

Hmmm - do you mind sharing a brief description of the questions? (Don’t provide the exact question due to NDA) I’m asking since you might be over engineering it. Maybe it’s just a tribal trie, or other basic DS/DP problem.

Facebook Hodinkee Jul 4, 2019

Check also fenwik tree, it’s simpler

SkedGo UzlM34 OP Jul 4, 2019

Thanks. will check it out.

New
aove Jul 4, 2019

Usually segment tree, trie, and udfs. And always prepare for dynamic programming for google

Facebook Hodinkee Jul 4, 2019

What’s udfs?

SkedGo UzlM34 OP Jul 4, 2019

I guess he means UFDS which is union-find disjoint set.

Nvidia Jfdfhj Jul 4, 2019

Google interviews were invented by idiots. Not surprisingly, as many other idiocy ideas, it has many followers. They also are trying to follow the ideas of that old fart Robert Martin, who thinks he is Confucius.

Amazon batou Jul 4, 2019

which idea of Robert Martin is bad?

Nvidia Jfdfhj Jul 4, 2019

That a software engineer must work 60 hours a week and be paid only for 40? In all his ideas he takes a moral stance peppering everything with stories about himself. It's his opinion how to be *righteous* devoted developer or architect. No wonder his books became a gospel. Because it's not science, it's preaching. This is why I compare him to Confucius. It's funny, some of his ideas come from his ADD. He probably even doesn't realize that. He doesn't care about being logical or base everything on science. It's all about the right public roar of support. He is too much like Trump. Check out his "WTF is monad".

Google mtwn38 Jul 4, 2019

Can you iterate through an array without turning it into a complicated mess? It's what the 99% do day to day anyway, and it eliminates a surprising amount.

Snowflake Computing jIMo27 Jul 4, 2019

Focus on dp and greedy style.