Implement a data structure which is able to return a value and a value before for a key in O(1) time complexity
Utilisateur anonyme
Provided correct solution. LinkedHashMap kind of structure in which the value node contains the pointers for previous and next node.