#why and how?
chrome topaz
Interviewer was deadlocked on what solution he wanted me to implement, I couldn't reach his approach and he didn't care about the other 4 approaches I propossed ( one had better complexity than the one he wanted). But well, shit happens.
Also, 0 tips on how he expected me to reach his approach. I knew what he wanted after I searched the problem after the interview. lmao
robust bronze
what the actual fuck
this was for the phone interview?
I think facebook has this approach
suggest bruteforce to show that you can solve it
but as you come up with optimal they will guide you
so just kiss their ass and let them guide you
valid goblet
sounds like an awful interview. interviewers should be open to any approach (and if you find one that isn't what they expected, it should be bonus points lol)
robust bronze
They even say this in their interview preparation material that the most important thing is to satisfy the interviewer by listening closely to them and do as they wish essentially
yeap
valid goblet
especially if you can reason about different approaches and discuss tradeoffs
robust bronze
unfortunately though, you have to work with what you get 😦
I'd rather eat shit and get past an interview
some interviewers just don't want to pass you further into the process for some reason
I wonder what the thought process is honestly
valid goblet
I'd rather eat shit and get past an interview
eh, sometimes the approach they look for isn't what comes to you naturally
sucks that it happened on a phone interview though. 1 strike and you're out
chrome topaz
Yeah, I do know shit happens. And well, I gave him 4 solutions : O(n log n)-O(n)memory , O(n^2)-O(1)memory , O(n log k) -O(n)memory , O(n) -O(n)memory . But he wanted me to do O(n) ( worstcase O(n^2) ) with O(1) memory . I was able to solve the second problem witht the most optimal solution
I thought that would be enough but seems that it wasn't.
chrome topaz
@small herald did you answered with qs ?
small herald
he didnt let me move on to another problem. i gave him brute force first, then the nlogk one. but he wanted O(N) and i just wasnt big enough brain to figure it out
chrome topaz
dont worry, that is some idiotic shit tbh. Most likely people that solved it was because fb tagged and they memoized the answer
small herald
dont worry, that is some idiotic shit tbh. Most likely people that solved it was...
ya this was a while ago. i feel sorry that u had the same problem
and judging by the way the interview was conducted, i think u had the same interviewer too
fair parrot
ya this was a while ago. i feel sorry that u had the same problem
Hey, you Intervieving trading firm?
chrome topaz
Sure, this is the loss I am hurt the most, so you can be sure Ill post anything
small herald
my username doesnt mention anything about trading lol
fair parrot
So sorry
small herald
all good lol
small herald
I misread it
happens lmao
tulip mica
what the actual fuck
You're expected to solve in 20 mins. Doubt there's enough time for that
sacred crescent
noooo my dude
robust bronze
@chrome topaz I sent you a friend request, seems like you disabled the dm hahahaha
grave hornet
@chrome topaz
Man that sucks!
I sent you friend req too. Can you accept?
sacred crescent
Yeah, I do know shit happens. And well, I gave him 4 solutions : O(n log n)-O(n)...
sounds like top k problem, and he wanted you to solve via quickselect
damn that sucks though, i wouldve given a hint about the quickselect approach like (your first solution used sorting, but is there a specific sort with somewhat the time complexity im looking for?)
chrome topaz
damn that sucks though, i wouldve given a hint about the quickselect approach li...
nah, 0 hints
sacred crescent
at this point im prob gonna get rejected too, i havent heard back yet
sacred crescent
@chrome topaz first letter of ur recruiter’s first name?
chrome topaz
M