Round 1 1. A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. 2. Print a N * M Matrix in a spiral loop. Round 2 1. What is Paging? 2. Design and implement Classes with Inheritance and Virtual Functions for a given Design Problem. 3. Find maximum sum of triplets in an array such than i < j < k and a[i] < a[j] < a[k]