Moved to

LRU

Report broken link here: ‣

Idea

• head & tail are 虚拟头，both help to make working with edge cases much easier
• Hashmap uses the key as key, the node as as value
• 3 operations to update the linkedlist → moveToHead(), addToHead() & removeLast()

Space & time analysis

• Space O(n) - we are using a hashmap to hold the key-value pairs

• Time O(1) - all the operations are O(1)

  • searching on hashmap
  • updating linked list

• 1st attempt (python)

• 2nd attempt (java)

• 3rd attempt (java) ❤️