16.25 - LRU Cache - C/Cpp and OS

Search…

Templates and methods

Linked List with C

Linked List with C++

Graphs with C/C++

Trees with C/C++

DS with C

Reverse Linked List

Implement Queue with LL

Find mid of LL without traverse

Delete a Node from LL

Create a Binary search tree

String and Array

implement strcmp in C

Maximum Subarray

CTCI

Ch 01 - Arrays and Strings

Ch 02 - Linked List

2.1 - Remove Duplicates

2.2 - Return Kth to Last

2.3 - Delete Middle Node

2.4 - Partition

2.5 - Sum Lists

2.6 - Palindrome

2.7 - Intersection

2.8 - Loop Detection

16.25 - LRU Cache

Algorithm

Basic Concept in C

Understand about pointer

Pre/Post Increment Operator

string and constant charaters

buffer overflow

Short-circuit evaluation

Allocate memory for 2D array dynamically

OS review

Reference

Question Collecting:

Template on Linux

Powered By GitBook

16.25 - LRU Cache

Design and build a "least recently used" cache, which evicts the least recently used item.
The cache should map from keys to values (allowing you to
insert and retrieve a value associated with a particular key) and be initialized with a max size.

When it is full, it should evict the least recently used item.
You can assume the keys are integers and the values are strings.

2.8 - Loop Detection

Last modified 5mo ago

Copy link