I have on-site interviews scheduled at confluent and I’m looking for some help or resources for prep. I looked on the leetcode discussion for confluent and passed the phone screen (leetcode hard) because the questions was listed. I’ve seen recently that their coding round is a windowed average problem. This seems like the leetcode problem time based key-value store except with no binary search? I’ve seen someone mention a doubly linked list (DLL) approach? Could someone point me in the right direction? Coinbase supposedly has a similar question. For the multithreading interview I’ve seen the problem listed as a task scheduler. Does anyone have any resources for this problem? Any help is greatly appreciated! #tech #hiring #swe #l3 #hiringcommittee #confluent #faang #software
@shaboop can you share the windowed average solution
Sharing my experience: Phone screening: wildcard match Onsite: Design task scheduler. Search phrase in document Design: design a data store (key, value) I got rejected Because of design round.
What question were you asked in phone screening round?
India
Yesterday
603
Any Indians Think Kashmir Should be Independent?
Cars
Yesterday
1636
Electric cars depreciate 10 times faster than gasoline cars
Fitness
Yesterday
3007
Very thin yoga pants
Tech Industry
Yesterday
1705
I do tech screens at Google. AMA
Tech Industry
Yesterday
744
East Asian Men don’t talk to me bc I’m Vietnamese
Was there any tech screening round, when did you hear back for onsites? P.S you can google for confluent tagged questions, also check Lc discuss
Yes I said I had a phone screen and passed because I looked on leetcode discussion. My problem is that the outline of the question wasn’t very good so I don’t understand what the original problem was to actually solve it