Alex Kangalexkang.hashnode.dev·May 3, 2023LRU Cache (LeetCode)Problem Description https://leetcode.com/problems/lru-cache/ Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size ...Discuss·26 readsleetcode
Nishanth Prabhunishanthprabhu.hashnode.dev·Apr 22, 2023Implement a Cache with Time-to-Live (TTL)Problem Description You are building a backend service that needs to perform database lookups for various queries. However, the database is slow and it's not feasible to query it for every request. To speed up your service, you decide to implement a ...Discuss·69 readsJavascript Interview- The Hard PartsJavaScript
Samuel Sorialsamuel-sorial.hashnode.dev·Oct 27, 2022Database Buffer Pool - Part 2Introduction As explained in Database Buffer Pool - Part 1, a buffer pool is a limited chunk of memory, which means that whenever we bring something from the disk, we need to evict something from the buffer pool and replace it. Buffer replacement is ...Discuss·1 like·276 readsDatabasedatabase
Keshav Bistkeshavbist.com.np·Oct 2, 2022Implementing LRU Cache in GoIntroduction Least Recently Used (LRU) cache organizes recently added/accessed items at the front of the list while pushing the least used items to the back. The number of items that can be stored in the LRU cache is fixed, thus least used item is ev...Discuss·842 readsLEETCODE (GO)LRU Cache
