Contacted through linkedIn. \nYOE: 7 years\n\n\n**Round 1**\nQ1: Given a tree and a node. Find the next right node of that given node and print the path from that node and right one . If there is no child, return null.\nBasically finding LCA of the given node and right node and print the path from LCA to both. \nQ2: Given a key, value, and timeout. After the timeout, the key should expire. Design a data structure for this usecase\n\n**Round2**\nQ1: Serialize and deserialize a binary tree, edge cases should be taken care\nQ2: Design a distributed cache\n\n**Round3**\nBasically it was an internal problem which he has faced. Do not remeber exactly\n\nAll the above rounds were on same day. I got a positive feedback\n\n**Round4**\n1.  Above my project in details\n2.  Sychronized keyword, mutex etc\n3.  Write a custom lock without using synchronize keyword\n4.  You have a PC with 8 gb memory. You want to run 3 process with which consume 3GB for each. How you can run? - Basically it was about virtual memory. I answered the same. Then he asked how it work, what is the swapping strategy etc. Didn\'t know.\n\n\n

Contacted through linkedIn. \nYOE: 7 years\n\n\nRound 1\nQ1: Given a tree and a node. Find the next right node of that given node and print the path from that n