1. Recruiter Call
2. Webex round (1 hour) - Tech 1
3. Face-to-face (1 hour) - Tech 2
4. Face-to-face (1 hour) - Tech 3
5. HR Call (Over Phone)

Round 1:

1. Add two linked lists.
2. Swap elements in an array to form the largest possible number.

Round 2:

1. Kubernetes-based questions: Unable to answer most of them.
2. Input: "How are you" Output: "you are How"
3. Ways to create an object in Java.

Round 3:

1. Given an unsorted array, find the count of elements greater than a target.
2. Extension of the previous question: If the array is sorted, how would you optimize the given problem? (Binary Search approach)