2 coding rounds of 1 hour each

**1 st round - **

INPUT

a1 = 'xyz'
b1 = '/home/$a1$'
c1 = 'workstation'
d1 = '$a1$@$c1$:$b1$'

INPUT: variable_list: List(str), values: Dict(str,str)
OUTPUT: Print the list of variable names and resulting value

OUTPUT
a1 = 'xyz'
b1 = '/home/xyz'
c1 = 'workstation'
d1 = 'xyz@'workstation:/home/xyz'

It was expected to write the code and run it with a few test cases

** 2nd round - Design Question **

Design a data structure with constant time complexity, not restrictions on the space complexity, It should have the following methods
insert()
remove()
getRandom()
exists()
getLRU()

It was expected to write the complete implementation , starting from defining a node or a doubly linkedList.