Just finished a YouTube onsite. I did well on 3 of them, struggled to come up with an overcomplicated(but creative) solution in another just to realize later there was a faster(O(n) -> O(logn)) simpler solution I couldn't see at the time, and think I did well enough on the last one(L5 interviewer) but it was an infinity/heuristics problem so it's hard to gauge. What are my chances? This was for a frontend L3 role. Thanks! Update 1: recruiter got back with some feedback. 2 hires, 1 leaning hire, 1 no hire, 1 pending
Whats 2 med?
Whats an infinity/heuristic question? I swear Google has the most variance in onsite questions
For google do we need to come up with the most optimal solution ? Or will it work if we just come up with “somewhat “ optimal soln ,(it would work for sure but not the best ). I am not able to understand how one can come up with a perfect optimal solution with O(n) in 20 - 25 min if we haven’t heard of that already . Researchers took days to find an optimal soln for these .. so shouldn’t they be more forgiving even if soln is not the best optimal ? Or am I just dumb !
The idea is to get it right on the first attempt, and if not, get the semi optimal solution straightaway so you can work with the interviewer to make it optimal for the rest of the time.
Hmm got it
Let me know once you find out! Just had my on site as well
How difficult was your onsites?
Just got an update. Seems like interviewers submit their feedback within 1-3 days. 2 hires, 1 leaning hire, 1 pending, and 1 no hire. Pretty sure I know which one that came from. Right now I'm wondering what determines a "no hire" because I was atleast able to solve it, just not optimally.
Can you guys please share if the questions asked were all from leetcode.. Also how tough was the system design round
DM me the questions please :)
Me as well
Sorry I signed an NDA so I can't disclose. But a lot of them required a combination of common algorithms/techniques like bfs DFS permutation to solve. I'd say difficulty level was 2 LC Med 1 LC medium(harder end of spectrum) and 1 LC hard(on easier end of spectrum) and the heuristics one idk Also it was 2vanilla JS is 3 algorithms