1. English assessment - online 2. Technical assessment - online 2A. IT fundamentals 2B. Data Science 2C. Coding 2D. Gamified assessment (sudoku, memory assessment) 3. In-person interview - tech + HR Coding questions: 1. Problem Statement Given three arrays A, B, and C containing distinct integers, where: * Array A contains N elements. * Array B contains N − 1 elements and is formed by removing exactly one element from A. * Array C contains N − 2 elements and is formed by removing exactly one element from B. Write a program to identify: 1. The element X that is present in A but not in B. 2. The element Y that is present in B but not in C. Print X and Y on separate lines. 2. Problem Statement Given an N × N matrix of integers, find the length of the longest path consisting of consecutive numbers. A valid path can move only in the four cardinal directions: * Up * Down * Left * Right A move from one cell to another is allowed only if the value in the next cell is exactly 1 greater than the value in the current cell. Return the length of the longest such consecutive sequence that can be formed in the matrix.