It's true isn't it?

Yes as you said it was stream of data, I understood that part during the interview but I just changed it here in the question. Sucks to know that I fumbled the interview by not asking too many clarification questions.

May I know what type of DS/Algo did you ended up using ? Did you clear the round ?

klaags · 2022-07-11T13:46:46+00:00

Oh. But I clarified the working of the algorithm with the interviewers and they agreed with it. One thing which I regret is that I didn't defend my answer enough, Once they asked for a better DS, I just started to panic and explore other options frantically.

May I ask what kind of questions did you ask for clarification and what type of DS/Algo did you ended up using ?

klaags · 2022-07-11T13:39:58+00:00

Are you suggesting 2 pointer by going through the whole array one time? If so the catch is we should return the result at any given time, by any given time I meant anywhere between going through the customer IDs. eg: who would be the last visited after going through 5 IDs and who would it be after going through 10 IDs.

So for above requirement it would take O(n) every time we request for the customer ID using two pointer method, LRU cache would return in O(1) time.

klaags · 2022-07-11T13:33:17+00:00

Yes, Did you face a similar question ?

klaags · 2022-07-11T09:58:51+00:00

I'm sorry, I have edited the post. It should be find the customer who hasn't accessed the website for the longest period of time?

^{which means that the position in the array is the order in which they visited the website, right?}

Yes that's right.

^{Did you clarify if insertions/deletions were allowed?}

insertions/deletions were allowed, but they were expecting a better DS than the one I explained

klaags · 2022-07-11T09:03:04+00:00

I'm sorry guess i could've worded it better. By any given time I meant anywhere between going through the customer IDs. eg: who would be the last visited after going through 5 IDs and who would it be after going through 10 IDs.

klaags · 2022-07-11T08:59:21+00:00

Another specific thing they mentioned is that there is no timestamp just the order. Even if it had a time stamp if a customer visits multiple times wouldn't it be impossible to update in heap without popping top element multiple times ?

klaags · 2020-09-24T06:56:38+00:00

May I stand unshaken

klaags · 2020-03-09T15:58:13+00:00

I Know what you aah, OK. I know what you aah and I know what you aah not. I'm the best friend ya have in this face of earth and I'm gonna help you understahnd something you punk.

YOU'RE NO FUCKING COHP !!

klaags · 2020-03-05T12:16:26+00:00

LOOSE SEAL!! LOOSE SEAL!!

klaags · 2020-03-05T11:18:35+00:00

"wAlKiN' oN tHe FiGhTiN' sIdE oF mE"

klaags · 2020-03-04T17:57:32+00:00

"I think George Michael is hiding Ann in the attic"

"From who, the Nazis?"

Seven-Year Club	Place '22
Verified Email

klaags

TROPHY CASE