did u solve all the questions optimally ?

[humble atlas]

title

[heady geyser]

Hc?

[kind lantern]

why do u think u got the reject? also when was ur final

[woeful stag]

.

[stoic jolt]

^

[foggy heart]

did u solve all?

[twilit lynx]

.

[junior prairie]

g

[coral mortar]

solved 3/4 immediately optimally, last one interviewer trolled me and fumbled my way to optimal solution but didn't have time for follow ups

[shadow ocean]

did u only have 2 interviews

tehcnicals

[coral mortar]

yes

[coral mortar]

not sure

[shadow ocean]

damn no followup technical is a bummer

[glad timber]

Wdym by interviewer trolled u

[lofty dock]

tagged qs?

[glossy peak]

.

[coral mortar]

Was thinking of dp solution for tree question and interviewer doesn't consider dfs with memoization as dp on trees and guided me away from intended solution

8 days and no

[coral mortar]

some

[tranquil drift]

Is ur recruiter initials TG

[glad timber]

Oh I think Meta does not consider Memoization as DP

[sacred crag]

what did you get asked?

[plush breach]

i don’t know why they say no dp and then give you recursion with memoization

[sturdy sundial]

dm

me

[sacred crag]

?

[heady urchin]

Dude f that interviewer

[coral mortar]

so true david

[coral mortar]

I signed an nda (can they sue me)

[stoic jolt]

you can dm, up to you, ppl do it all the time

if so, I would like to know the question as well :)

[pliant flame]

Yeah me too

[sturdy sundial]

Bruh they aint doing nothing after rejecting you

[vocal lagoon]

me too if u dont mind 🙏

[sacred crag]

they can’t sue you

first they rejected

secondly they’re not here

third they can’t confirm your identity through discord, discord protects your identity

[slate coyote]

Me too, pretty please

[coral mortar]

Kth largest element in array
Range Sum of BST (Follow up: how would you optimize it if the tree doesn’t change and your function is called many time)

Find local min in an array (Follow up: optimize time complexity from naive approach)
Find subset of nodes in a binary tree such that no two nodes are adjacent and the sum is maximized

Enjoy everyone and Meta don't sue me plz

[sacred crag]

they don’t even know who you are dw

you’re the goat

appreciate it

[shadow ocean]

Can u bfs the last q?

[sacred crag]

i think it’s DP + bfs

[shadow ocean]

why dp?

[sacred crag]

if i’m not mistaken?

optimization for value

basically need to memoize results

[coral mortar]

dp and dfs is what i ended up doing and interviewer seemed satisfied with it

[shadow ocean]

unlucky af

[sacred crag]

But that’s a scam

they said you can solve problems

without dfs

in the email

without dp***

what’s the alternative option lol a 2^n algo???

lmao

[shadow ocean]

Is the range sum followup dp?

[coral mortar]

i said to just precompute and do a prefix sum assuming max value is nto that big and interviewer seemed satisfied

[sacred crag]

wdym by prefix sum?

[shadow ocean]

Oh yeah

[sacred crag]

just compute it once, if tree doesn’t change

return that value from then on

unless i misunderstood you

[coral mortar]

yeah but the ranges could change

the range they wanna query on

[sacred crag]

ohhh

[sacred crag]

so you stored the sum up until a certain node for each node

[stable marsh]

ty boss

[vocal lagoon]

for the 3rd one is it just find peak element but minimum, so find non peak element?

want to make sure i understand it correctly, for 4th we return the max 'path' such that no two nodes are adjcaent?

[robust jackal]

@coral mortar when did you interview?

[coral mortar]

8 days ago

[robust jackal]

so u ended up solving 4/4 but still got rejected?

just because you couldnt get to a follow up?

could it have been the behavioral in that case?

[sacred crag]

i doubt it lol

[sacred crag]

^

[sacred crag]

^

[robust jackal]

he didnt solve it immediately but did solve it eventually

[sacred crag]

they don’t like that

[shadow ocean]

If thats the case I might be cooked then, didnt solve immediately but grabbed onto hints and solved it eventually with time to spare

[sacred crag]

if you don’t know it off the beginning basically it’s alr a coin flip

depending on interviewer

[shadow ocean]

But I didnt get asian interviwewers so thers a chance ig

[sacred crag]

wait actually @coral mortar can you check your dms and lmk if you got any of the same interviewers

[coral mortar]

yeah maybe i'm bad at behavioral thought i did fine

[sacred crag]

maybe 🤷‍♂️ but i doubt it

[peak wing]

for kth largest element did u use heap?

or bucket sort

n log k good enough or na

[slate coyote]

I think they require the quick select solution

[vocal lagoon]

no way

[sturdy sundial]

I used quick select but interviewer asked to do whichever one

[sacred perch]

It really depends on the expectation of the interviewer. But choosing the optimal is most safe. Who knows he is a nice guy or not?

[sturdy sundial]

but choosing quick select and not knowing how to code and to change to heap is crimial

[foggy heart]

quick select is n^2 worst case tho

[sturdy sundial]

But average is O(n) which prevails most of times because we are choosing a number at random. The interviewer did ask me this.

[foggy heart]

did u start w quick select or heap then he asked u to optimize? bucket sort is also O n tho

[peak wing]

So u can do heap and its fine

(n log k soln)

?

[sturdy sundial]

I told 3 approaches and i said quick select is most optimal, i asked which one. He asked do whichever one you like

[foggy heart]

is quick select better than bucket sort

[sturdy sundial]

I think you confusing quick sort with quick select

[sacred crag]

quick select is the algo

for top k elements

u got asked top k elements?

[stoic jolt]

for range sum of bst follow up, did you have to code it?

[peak wing]

@sacred crag do uk if heap is good enough

[sacred crag]

no clue

ig we'll find out if i get it

[sturdy sundial]

I heard somebody say heap might be good