<pre class="shiki github-dark shaku"><code>// This is a JavaScript coding problem from BFE.dev /** * @typedef {object} OriginData * @property {string} origin * @property {number} lastUsed * @property {number} size * @property {boolean} persistent */class MyLRUStorage { constructor(capacity, getTimestamp) { this.capacity = capacity; this.currentCapacity = this.capacity; this.getTimestamp = getTimestamp; this.cache = {}; } getData(origin) { if (origin in this.cache) { this.cache[origin].lastUsed = this.getTimestamp() return this.cache[origin]; } } setData(origin, size) { if (size &gt; this.capacity) return false; if (origin in this.cache &amp;&amp; size &lt;= this.cache[origin].size) { this.currentCapacity = this.currentCapacity - this.cache[origin].size + size; this.cache[origin] = { lastUsed: this.getTimestamp(), size, persistent: false } } else { while (this.currentCapacity &lt; size) { const didEvict = this.evictData(); if (!didEvict) return false; // not possible to remove any cache element } this.cache[origin] = { lastUsed: this.getTimestamp(), size, persistent: false }; this.currentCapacity -= size; } return true; } evictData() { const cacheKeys = Object.keys(this.cache).filter(item =&gt; { return !this.cache[item].persistent } ); const keyToRemove = cacheKeys.sort((x, y) =&gt; this.cache[x].lastUsed - this.cache[y].lastUsed)[0]; if (!keyToRemove) return false; this.currentCapacity += this.cache[keyToRemove].size; delete this.cache[keyToRemove]; return true; } clearData(origin) { const spaceToRelease = this.cache[origin].size; delete this.cache[origin]; this.currentCapacity += spaceToRelease; } makePersistent(origin) { this.cache[origin].persistent = true; }}</code></pre>

Good question for storage

Chrome uses LRU algorithm to evict data when it has to. Watch this Youtube video for detail explanation, starting from 6:25 to 7:38. Now you are asked…