Jobee Fie Interview Questions and Answers

LRU caching is a technique to store frequently used data in cache memory to improve performance.

• LRU stands for Least Recently Used.

• It removes the least recently used item from the cache when the cache is full.

• It uses a doubly linked list and a hash map to implement the cache.

• When an item is accessed, it is moved to the front of the list.

• When the cache is full, the item at the end of the list is removed.

• Example: Java LinkedHashMap and Python OrderedDict use LRU caching.

Print all anagrams of same type in same line from array of Strings

• Create a HashMap with sorted string as key and list of anagrams as value

• Iterate through array and add each string to corresponding list in HashMap

• Print all values in HashMap

Producer-consumer problem involves synchronization between threads to avoid race conditions.

• Producer produces data and adds it to a shared buffer

• Consumer consumes data from the shared buffer

• Synchronization is required to avoid race conditions

• Code example: https://www.geeksforgeeks.org/producer-consumer-solution-using-threads-in-java/

To check if a tree is a BST or not.

• Traverse the tree in-order and check if the values are in ascending order.

• For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

• Recursively check if the left and right subtrees are also BSTs.

Reverse a single linked list.

• Iterate through the list and change the direction of the pointers

• Keep track of the previous, current and next nodes

• Set the head of the list to the last node after reversing