About 94,300 results
Open links in new tab
LRU Cache - LeetCode
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 capacity. int …
LFU Cache - LeetCode
To determine the least frequently used key, a use counter is maintained for each key in the cache. The key with the smallest use counter is the least frequently used key.
Minimum Number of Days to Make m Bouquets - LeetCode
Can you solve this real interview question? Minimum Number of Days to Make m Bouquets - You are given an integer array bloomDay, an integer m and an integer k. You want to make m bouquets. To …