#I got asked an easy too
1 messages · Page 1 of 1 (latest)
the bar is both low and high
I almost laughed when i saw two sum pop up on my screen
the bar is wavy
damn wtf I want an amazon interview
Yup, seems they do just ask lc easies i guess
did you put that you know machine code on your resume or smth
nvm
i thought u said assembly
Nah they just wanted to test my cs fundamentals for some reason
Not sure if i answered right but i used my comp arch class knowledge
Wtf
I think I forgot how two sum was solved lol
I’ll probably network with recruiters at my school to hopefully skip OAs if I get the chance
idk if a company like amazon does that
I doubt they do
Maybe something smaller like Accenture, visa, kohl ‘s type of stuff
Usually non tech companies
machine code and proving binary search in the same interview
Is this for amazon final? @rain lichen
Wdym by machine code tho? Like assembly?
machine code is below assembly, it's a sequence of bits 0 and 1
Ah okay I see damn
two sum in assembly
idk any assembly
my friend got lru cache
Was he allowed to implement using a dictionary/hashmap or strictly linked list?
I got valid word square
doubly linked linked list
Ok that’s a bit harder lol
how would u do that with just a linked list
Oh I meant to say doubly linked list
Too lazy to type doubly
how would you do it with just a doubly linked list
Yeah I think for lru cache you need a DLL and a hash map no?
Yeah but if you wanna cheat then you can forget about DLL and just use ordered hashmap in python lol
thats not going to work in an interview
Yeah ik
did they provide you an instruction set reference or smth? No way they expect anyone to have memorized the instruction set, unless you're an embedded engineer and it's risc.
Nah, i dont think they expected that tho but no clue what answer they were looking for
I got two sum last year, solved it and still failed lmao idk
yea lol and a simple followup
What was follow up about specifically?
O(1) space complexity for two sum (time does not matter)
Just bruteforce then....right?
Nah, i did sorting so its not brute force and then used two pointers