#!process zon reject
1 messages · Page 1 of 1 (latest)
interview was yesterday
i think i did fine
LP’s was decent. Coding was design based. I told him my approach, we had a long discussion. I was asked to then write a function and then we discussed more. Then we ran out of time!
i might have messed up somewhere!😞
damn
sorry man!!
do you require sponsorship by chance
were you international
There are many internationals who got amazon, dont think that matters
i just thought that many internationals who did good didnt get the offer so it might matter a slightly
Damn is getting rejection that soon normal?
im worried about me tomorrow this is crazy
It always matters to an extent man
timeline?
I am an international student. I don’t think that should matter considering 3 of my international friends got offers as well
hey sorry to hear about the reject :/ what kind of system design question did you get if you dont mind sharing?
also when did you complete the OA?
OA-> 27th Dec
Interview Email->27th Jan
Interview-> 4th Feb
Reject-> 5th Feb
Question was something like:
predict the next word given last 3 words in a sentence
Predictions are already stored somewhere
Decide what kind of DS you want to store in
And given a sentence what will be the prediction
Word: I
Prediction; am
Word: I love
Prediction: to
Word: I like to
Prediction: eat
Word: I love to
Prediction: fish
Prediction will be single word
Predict based on last 3 words in a sentence
How did you approach this question?
Seems like that
It’s only based on three words probably not trie?
thanks for your help! wish you all the best with your internship hunt
I gave a trie approach
I am just grateful that I atleast got one interview
was your interviewer helpful?
He didn’t give any hints explicitly
Just kept asking questions
But he was really sweet
What do you think we could use?
Under the interview pressure All i could think about was Trie
Idk I think trie might be the approach but since it’s based on the last three word not everything right
This is a pretty hard question to be honest if trie is not the solution
You could have I like to fish and I like to hunt and how would you go about that
Yes correct
What i wasted my some time was I assumed i had to predict multiple words
But output was supposed to be single word
Did the interviewer agree w you when u said trie
Wait I don’t think I understood the question that was asked to you. Did you have multiple prediction “words” for the same 3 input words? I.e. I like to - eat and I like to - drink?
Or was it a 1:1 relation?
Like is it base on frequency of one word appearing after three words?
Otherwise you would have no way to decide between two words with the same last three words
Exactly
And if it was a 1:1 as in 3 words could lead to one unique word, you shoulda used map instead of a trie
I don’t think it was as simple as a hash map tho, I think op would have been able to come up with that sol no matter how nervous
But if you use map for a sentence with 9 words you would have at 7 entries
I think trie with frequency stored might be the go
I still don’t follow the question lol
Just ask gpt
For any given 3 words there was only one possible prediction
I initially did say hashmap but I wasn’t able to exactly explain. Once I explained Trie approach interviewer asked me a couple questions then asked me to start coding
interviewcoder 💀
No i mean like theyre discussing how it was supposed to be solved post VO
Like if ur wondering so much just ask gpt
since there is only one possible prediction for any 3 words I think map is sufficient
if it was many possible predictions then trie
Scalable solution is trie but yea
Since its small
Hashmap better
But tbh idk if that wouldve mattered in interview right?
Theyre very similar anyways
Im efficiency
let’s just end it at interviewer rng 
Yes I did mention Hashmap then I got confused and maybe thats where i fumbled and lost it
I’m so confused
Where is the solution pulling “eat” from
What is the question even asking 💀💀
you get an input you predict output
How can you do this without ML
or like a huge dictionary of sentences
This is what i was asked to do
We have input
We have the prediction
How to store it and how to use the stored data to give the output
I see, so you store previous inputs and then use those for future predictions
this
u just match
the input
to an output
literally
Yeah … this question is kinda ass, but I think trie is the most intuitive negl
trie is intuitive and the "smartest" approach that shows DSA knowledge
but a hashmap wouldve prob been better
regardless
i think this was interviewer rng
The issue though is like, if the only input is “I love” how can you predict “to”
Since it’s not stored in your trie yet
yeah i think so this
"to"
literally thats it
tbh idk why this is difficult to understand maybe im oversimplifying it or not getting it
I just initially missed that there was only one output
and messed up this basic solution
damnn
No i think you are correct
I just got confused there
maybe thats what the red flag was
Yeah correct
Hence the rejection in a day i suppose
cuz ngl that is a trivial very trivial answer if thatsa actuallyt the answer
yeaaaa
oh well dude
im sure it was just nerves
cant think right when ur nervous
Wdym
bro u know how hash maps work right
key value pairs
the key is the sentence up until the word
then the value can be the predicted word
literally thats it
Yeah but if your map doesn’t have the word
theres no real rpediction its just mapping a value to another value
How do we know tho
it says in teh question
that the predictions you already knoww hat theyre gonna be
just based on alst 3 of a sentence
so just exttract teh last 3 in a sentence
and compare them againsdt u hashmap of ketys
trivial
id cry of joy if i got this as my question
i havent even prepped lc and i could solve it
So they give us the prediction … and we’re trying to find the prediction
Oh I’m regarded
I didn’t even see the “predictions are stored somewhere”
Lmao no way
I didn’t think that would be the case, or else this question was dummy easy
I thought we were building our data structure along the way
doesnt seem like it
So we would have to mark the start node of the word in the tree
but idek i mean its nto like it was a bad answer
Like I would answe r it both ways, describing the + and - of each way
its nearly the same efficiency
yea
maybe just red flag not being able to intuit hashmap approach
just nerves prob
@steep blade i think I found your question 😭 https://leetcode.com/problems/design-search-autocomplete-system/description/