Coding an Efficient LRU Cache in Golang: Part 2 скачать в хорошем качестве

Coding an Efficient LRU Cache in Golang: Part 2

Check out my email 📩 newsletter for engineers that care about delivery, business impact, and career growth ➡️ http://bit.ly/dev-dispatch 💻 The LRU Cache is an interesting problem and a typical algorithm for pairing interviews. 📹 In this video I’ll explain how to implement an LRU cache that scales in constant time, using a map & a linked list, so performance doesn’t degrade regardless of cache size. Part 1:    • Coding Interview Algorithm: LRU Cache   ——————————————————— 👨‍💻 About the channel: Sam x Smith This channel is dedicated to software engineering, programming and distributed systems learning & education. Technology defines every era, and computer science is the breakout technology of our time. 👷‍♀️👷‍♂️ Understand today. Build tomorrow. ——————————————————— FAQ Q: Do you have a blog? 📜 A: I write about life & software at samxsmith.com Q: What job do you do? 👨‍💻 A: I’m a software engineer. Q: What laptop do you use? 💻 A: I use both a MacBook Pro & a Lenovo ThinkPad. The latter runs Fedora Linux. Q: What programming languages do you use? A: I like to choose the best tool for the job. Day to day, I use Go(lang), Node.js (JavaScript), Rust & sometimes C. Q: What editor do you use? A: I mostly use VSCode. But for Go, I use Goland which is a fantastic Go-specific IDE by JetBrains.