An LRU Cache is a mechanism that keeps recently used items around, but when the cache reaches its limit, the least recently used item is discarded to make space for a new item.
What is LRU Cache and How to implement it yourself? Read More »
Problem Statement Given an array of integers arr, write a function that returns true if the number of occurrences of each value in the array is unique, otherwise return false. Example For the array arr = [1,2,2,1,1,3], the number of occurrences are: 1 appears 3 times, 2 appears 2 times, and 3 appears 1 time.
Unique Number of Occurrences: Coding Interview Problem Read More »
Problem Statement: Given an array of integers, nums, and an integer target, return the indices of the two numbers such that they add up to the target. You may assume that each input would have exactly one solution, and you may not use the same element twice. Example For the array nums = [2, 7,
Solving “Two Sum” Coding Interview Problem Efficiently Read More »