Final

[jolly fiber]

what time did you get the reject PST

[steep shore]

sry to hear that

howd u think u did on it

hm

aight, gn

sry to hear that tho

i hope u have better luck in future interviews

ok

aint no way

why do people have to keep trolling on this lol

[icy quest]

yea lmao

im tweaking

[steep shore]

i thought he was gonna say something like he forgot how to create a dictionary or something

[icy quest]

this just made me check my email

[steep shore]

lol

when did u take interview

[icy quest]

12/3

[steep shore]

oh dang

long time ago

how u think u did on it

[dreamy summit]

what questions did they ask?

[steep shore]

2 behav + 1 tech

[dreamy summit]

what was the tech question?

im tryna figure out what type of questions to study on leetcode

[steep shore]

i dont think that'll help much

they ask such a wide range of questions

just know the building blocks

[dreamy summit]

yeah its annoyin

cause im not that good with dp

and idk if they ask dp or not

[steep shore]

nah

dw

they wont

prob an array question or tree or graph (dfs/bfs)

[dreamy summit]

wait thats so good

only thing im good at lol

good luck with amazon!

thanks for the help

[steep shore]

thanks lol idk when ill hear back tho haha

[trail dagger]

just to be safe. study some classical DP tho, 0/1 knapsack a good one
a friend of mine failed Zon cuz she got a variation of 0/1 knapsack for her interview

[steep shore]

atp idek if ur lying or telling the truth

[shy mason]

i think he is lying, not entirely sure but its a difficult algorithim taught in theory classes, i doubt it would be asked

if he or someone is somehow asked that it was prolly just not meant to be

but take this with a grain of salt, fwiw it might be straightforward or something, i didnt look too deep into it

[fluid fable]

i was asked a pretty simple graph problem, given set of nodes/weighted edges, find shortest path starting from node, visiting each node once and returning. got the n^2 solution but they were looking for linear unfortunately i think

[quaint escarp]

just hamiltonian path? what if such a path does not exist

[steep shore]

oh dang, was ur interviewer not happy with u?

[quaint escarp]

yea they were probably expecting linear time, rip graph problems

[fluid fable]

yeah just shortest/least weight hamiltonian path

[steep shore]

how was the overall atmostphere of ur interview? was the guy happy to be there or he seemed disinterested

[quaint escarp]

linear time as in O(V+E) right?

that sucks ngl

all the ngmis getting hashmap problems

and end up not solving it

😭

[steep shore]

mannn idk when ur being genuine or not

[quaint escarp]

i know like 10 people

[steep shore]

cuz uve said u got rej from amazon like so many times

[fluid fable]

i cant tell if im being outjerked or not

[quaint escarp]

know this is genuine

no*

a lot of people are getting hashmap problems while others get graphs /dp

[steep shore]

@fluid fable

[quaint escarp]

depends on the team

[cursive bone]

graph/dp easier than hashmap problems ngl

[quaint escarp]

i got a graph problem sort of like his, my interviewer was interested but very serious and professional

which i liked

[steep shore]

wym?

[quaint escarp]

you tripping

[fluid fable]

(im trolling, the question i said is NP-hard lol)

[steep shore]

🤣

[quaint escarp]

depends on the team you're interviewing with

even if its general sde

[steep shore]

i swear i saw that in my algos class

[steep shore]

so the difficulty of ur problem corresponds to the team ur matched with

[quaint escarp]

not matched

just the team u interview with

its random

[cursive bone]

idk mane might me just a me thing

[quaint escarp]

the easiest lc hards are hashmap problems

say it aint so

[steep shore]

yea i interviewed with some dude in fintech

[quaint escarp]

if u got optimal and followups thats like guaranteed offer

dont even stress

[steep shore]

there were no optimal or followups. i just explained my thought process from the start very clearly asking really good clarifying questions about the constraints. and then i solved each section of the question (like in. my comments, i wrote steps) and explained my logic for each part. th einterviewer seemed to really like my answer and didnt have any other questions. i didnt do a formal dryrun, but as i was writing my comments and code, i was doing parts of it on the go

[quaint escarp]

if your interviewer didnt ask for implementation

and said thats fine

then you're good

[steep shore]

wym implementation?

[quaint escarp]

you never wrote the code?

[steep shore]

bro

i did lol

im saying for the beginning part

i never dry ran when i finished the code

[quaint escarp]

then why are you saying there's no optimal

[steep shore]

ig i didnt mention, but i solved optimal. he never asked time/space complex

[cursive bone]

it's pretty tough to find build the right key for hashmaps under intview stess i think, most graph from zon tagged are just knowing dfs/bfs/topo/uf

[quaint escarp]

yea ur good

[steep shore]

but he said my soln was perfect so thats my copium

[shy mason]

what is topo and uf

[steep shore]

topological sort and university of florida

[shy mason]

oh union find

meanie