The interview process consists of four stages:

1. Aptitude - Technical Test, Multiple Choice Questions
2. Pen & Paper Programming Test
3. Technical Interview
4. HR Interview

The Aptitude Test includes multiple sections, such as:

• Logical Reasoning
• English
• Basic Computer Knowledge
• DBMS & Programming Questions

Each section contains further subgroups, and each session has its own time divisions.

A key point to note before entering the hall is that there are no negative marks.

After the aptitude test, shortlisted students can attend the Pen and Paper Programming Test, Technical Interview, and HR Interview. This usually occurs at a specific college after a gap of about one month or something similar.

The Technical Interview typically comprises three rounds, focusing on how candidates approach problems. The HR Interview is generally straightforward.

Round 1:

• Given an unordered integer array, check whether the array contains a consecutive sequence of numbers. Display the largest possible sequence.

Example: array {1, 5, 2, 4, 3} Output: Yes 1, 2, 3, 4, 5

Example: array {2, 5, 12, 3, 4, 11, 9, 10, 13} Output: No 9, 10, 11, 12, 13

• A matrix of 0s and 1s is given. Find the number of groups of 1s in the matrix. Groups can be vertical or horizontal. The size and elements of the matrix are accepted as input.

• In a Car Stock Market, the rate of a car varies every hour, either increasing or decreasing. Find an algorithm for analyzing a day's price chart and displaying the efficient times for buying and selling a car.

Example: 10AM 11AM 12PM 1PM 2PM 10 5 3 7 1 Buy at 12PM and sell at 1PM.

Implement with complexity O(n).

Round 2:

• Write a program to eliminate duplicate occurrences of a character in a string and display '*' representing the count of each character as shown below.

String: MOHAMMED SHAKIR Output: 'M' 'O' 'H' 'A' 'E' 'D' ' ' 'S' 'K' 'I' 'R'

• Write a program which can solve a Sudoku Puzzle.

Round 3:

• Write a program to display all possible sequences of numbers from an array that sum up to a number inputted by the user. Implement using O(n) complexity.

• There are M sets, and each set has N1, N2,...NM number of elements respectively. Write a program to display all combinations of elements from each group.

Example: {Red, Blue, Green} {XL, L, M, S} {Shirt, Kurtha}

Output: Red XL Shirt Red XL Kurta

• Write a program to check if a string follows the Grammar: String -> t+r+u+e+

Example: ttrruueeeee Output: valid

Example: tuueeerr Output: invalid

• Puzzle: There are 27 boxes, each weighing 1kg. One box is defective and weighs only 800kg. How many weighings are required to find the defective box using a common balance?