1. Online Test

   • 2 Coding Questions & Behavioral Assessment

2. Personal Interview 1

   • Discussion on Project
   • 3 Coding Questions (1 easy, 1 medium, 1 hard)

3. Personal Interview 2

   • Discussion on the Project
   • 2 Coding Questions (1 medium, 1 hard)

4. Personal Interview 3

   • 2 Coding Questions (both questions are hard)

Round - 1 Questions:

1. https://leetcode.com/problems/intersection-of-two-arrays/
2. https://leetcode.com/problems/intersection-of-two-linked-lists/
3. Given an array, you have to partition it so that the sum of all elements of every partition is the same. Return the maximum number of partitions and the sum of the elements of each partition.

Example 1: Input: n = 3, nums = [2, 6, 8, 0] Output: partitions = 2, sum = 8

Example 2: Input: n = 10, nums = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Output: partitions = 10, sum = 1