programming-languages

LFU Cache

Design and implement a data structure for a Least Frequently Used (LFU) cache. Implement the LFUCache class: LFUCache(int capacity)Initializes the object with the capacity of the data structure. int get(int key) Gets the value of the key if the key exists in the cache. Otherwise, returns -1. void put(int key, int value)Update the value of the key if present, or inserts the key if not already Read more…

programming-languages

Evaluate Division

You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i]. Each Ai or Bi is a string that represents a single variable. You are also given some queries, where queries[j] = [Cj, Dj]represents the jth query where you must find the answer for Cj / Dj = ?. Return the answers Read more…

error: Alert: Content is protected !!
IAMISHAAN

FREE
VIEW