System Design Interview - Design a Distributed LRU Cache (Full mock interview with Sr. MAANG SWE)

[@tryexponent]

Make sure you're interview-ready with Exponent's system design interview prep course: bit.ly/474ucRM

[@AbhishekYadav-ib9jj]

Using doubly linked list is definitely required. During the get operations you’ll need to move the element to the head and delete from current location. With doubly linked list, deletion will constant time operation. With linkedlist, this will O(n) operation.

[@judeboachie]

Please add chapters to your videos. Will help a lot!

[@someshgangwar4013]

Great Video

[@AdityaGupta-yi7oe]

I would prefer a query router that would sit in bw Service Hosts and Cache cluster to route the queries, and service hosts and connect to this Router, just like we have in DB Sharding. Would this be a better approach to be suggested in an interview?

[@SpyrosGiann]

Thanks, great content! Out of curiosity, what software and hardware (is it a stylus?) is Ravi using to conduct the interview?

[@ravikant-hi8mz]

It is a digital pen - Wacom pen tablet and software is whimsical

[@tryexponent]

Hey SpyrosGiann, thanks for the kind words! The online whiteboard tool being used is called "Whimsical".

[@SUNNYKUMAR-cl1xw]

But why consitency and availability can’t be provided sql databases does that. Cap says any two at one point of time we can support.

[@lakshaymiddha2531]

I didn’t understand completely that why read requests would go to read replicas. We can read from primary and data will be more consistent. What’s the issue in this approach?

[@szyulian]

watched.😀-------

[@AdityaGupta-yi7oe]

23:35 I would prefer a query router of some sort that would sit bw Service Hosts and Cache cluster and Service hostts just need to connect to the router, the way we have in DB sharding. Would this be a better approach to be suggested in an interview?

[@ZenG2k24]

Great content. Love it :)