Round 1 Online Assessment

The first round was an Online Assessment conducted on a platform that was new, not the trivial ones used for other online assessments, there were four sections to be solved in 87 minutes.

The four sections were

1. Motion Challenge
2. Switch Challenge
3. Numerical Reasoning
4. Coding

Motion Challenge :

In this section it was a collection of puzzles , To be solved in 9 mins, There were different levels, once you solve the current level, the next level will be displayed, try solving maximum levels as possible, I would say solving 15+ levels is on a safer side, where in in a puzzle you have to move a ball to given hole, with some obstacles, here you got to move the ball to the hole by moving the obstacles with minimum no of moves possible.

Switch Challenge:

This section focusses on logical ability, to be solved in 9 mins, The centralized Idea of all the levels was there were four shapes, each associated with four numbers 1,2,3,4, then after the shapes will be jumbled, we have to find the order of numbers, again here try solving as many problems as possible.

Numerical Reasoning:

This round focusses on numerical ability, to be solved in 9 mins, again try completing this section asap. The questions were based on basic math and aptitude.

Coding-Advanced:

Question 1:

Height of a tree: The height of a tree is the number of edges on the longest path from the root node to a leaf. You are given a binary tree with unique integers in its nodes. Find the path to in from the root. The path will be described in form of ‘L’ for left and ‘R’ for right denoting the turns taken to reach n

Note: No null input is given

Input Format:

• The input consists of three lines
• The first line contains an integer representing the height of the tree.
• The second line contains multiple space-separated integers denoting the level order traversal of the tree. Nodes with value -1 represent empty nodes
• The third line contains an integer denoting n.
• The input will be read from the STDIN by the candidate

Output Format

• print the path consisting of ‘L’ and ‘R’ representing the path to reach n from the root node

Question 2 :

https://www.w3wiki.org/maximize-elements-using-another-array/

Job Profile: YTL Network Trainee
Eligible Course: B. Tech
Eligible Branches: CS, EC, EI, EE

The Whole Process consisted of three rounds :

• Online Assessment
• Technical Interview I
• Technical Interview II

Around 100-120 students applied across the eligible branches.