SDE - 1

You are given a linked list containing 'n' nodes, where every node in the linked list contains two pointers:

(1) ‘next’ which points to the next node in the list

(2) ‘random’ which points to a random node in the list or 'null'.

Your task is to create a 'deep copy' of the given linked list and return its head.

Note:

A 'deep copy' of a linked list means we do not copy the references of the nodes of the original linked list, rather for each node in the original linked list, a new node is created.

You are given an array consisting of 'N' distinct positive integers and a number 'K'. Your task is to find the kth largest element in the array.

Example:

Consider the array {2,1,5,6,3,8} and 'K' = 3, the sorted array will be {8, 6, 5, 3, 2, 1}, and the 3rd largest element will be 5.

Note:

1) Kth largest element in an array is the kth element of the array when sorted in non-increasing order. 

2) All the elements of the array are pairwise distinct.

Internal Implementation of ArrayList?
Runnable is preferred for making thread. Why?
Serialization in java?
Multi-threading
Difference between HashMap and Concurrent Hash Map
Checked and unchecked exception in Java
Can we use object as a key in hashmap in Java?
How to sort the HashMap based on the values.
what is Executor framework in Multithreading with example.
Three ways to iterate the HashMap

This round was taken by the Project Head and he was basically testing my problem solving skills.
This round was like technical and as well as manegerial as well.
Questions was like - 
How will I implement the concurrency system in CMS tool?
How will you innovate the product which they have and what functionality shoud I add?
Some SQL queries was also asked.

Will I am willing to relocate or not? 

What is the team size in which I am working in present organization? 

Salary discussion