The first two rounds were taken by the parent company. The third round was the client round (Nike).

All three rounds were technical.

The first round was not that difficult. The second round included technical questions and coding based on scenarios. The third round was also fully technical, and the coding test was very difficult, conducted by Nike.

1. Explain your projects.
2. How will you optimize Spark jobs in your work? (Spark-related questions)
3. How will you justify the reliability and durability of data?
4. What are lineage graphs and checkpoints in Spark?
5. Explain Spark's strategy.

Coding

1. Input is an array of integers. There is a sliding window of size W which is moving from the very left of the array to the very right. Each time the sliding window moves rightwards by one position. Find the maximum number from each window.

   Input array is [1, 3, -1, -3, 5, 3, 6, 7] and Sliding window (W) is 3. Output array is [3, 3, 5, 5, 6, 7].

2. Write a query to provide the number of times an employee received an increment and the maximum increment they received, along with the columns emp_id, emp_name, joining_date, and dept_name. Additional info: a. An employee may not be tagged to any department. b. An employee may not have received any hike.

   Emp table: emp_id | emp_name | joining_date | Dept_id

   Dept table: dept_id | dept_name | Dept_Location | Dept_Manager

   salary_increase table: emp_id | increment_date | inc_amount

3. Write a Python program to find an element in a list from the current element to the next index.

   list is ["Mon","Tue","Wed","Thu","Fri","Sat","Sun"]

   If the current element is “Wed” and the next index is 2, the result is “Fri”. If the current element is “Sat” and the next index is 23 (cyclic), the result is “Mon”.