Stable Money Interview Questions and Answers

LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.

• Use a doubly linked list to keep track of the order of items based on their usage.

• Use a hash map to quickly access items in the cache.

• When an item is accessed, move it to the front of the linked list to mark it as the most recently used.

Use three nested loops to find triplets with sum zero in array.

• Iterate through array with three nested loops to find all possible triplets.

• Check if sum of triplet is zero and store the triplet if true.

• Optimize by sorting array first and using two pointers approach.