TCS Assistant System Engineer Interview Questions, Process, and Tips

Q1. Where do you see yourself in 5 years?
Add your answer
Q2. Your self introduction
Add your answer

Round duration - 360 Minutes
Round difficulty - Medium

There will be 6 coding problems, Each question will have 1hr time
2-easy
2-medium
2-hard
If you solve atleast one problem,you will be qualified

Q1. Constellation
Given a matrix ‘UNIVERSE’ with 3 rows and ‘N’ columns, with the characters { # , * , . } and these characters represent a cluster of stars and galaxies in space. Stars are represented by ‘*’ ...read more
Ans. Recursive Approach
The key idea is to recursively check every 3x3 grid and see what vowel does it signify and it to the string. This can be easily done using a recursive function.
 
Here is the algorithm :
 
1. We take a recursive function ‘generateConstellations()’ and take parameters, ‘CURIDX’, which denotes the current column we are at, a matrix ‘UNIVERSE’ to denote the stars and constellations.
2. We define ‘MAT’ as ...read more
Answered by CodingNinjas
View 4 more amswers
Q2. Game in Space
Ninja is in space with his super spaceship having unlimited fuel. Ninja initially has a health level ‘H’ and his spaceship has an armour ‘A’. He decides to play a game, where at any instant h...read more
Ans. Recursive
The idea is simple, we will check all the possible ways of choosing planets with the help of recursion and find out which combination gives maximum time. 
 
Along with this, we will prefer to move Mars whenever possible as it is always beneficial to make a move to Mars.
 
• So we will make a recursive function named SOLVE which will receive 3 parameters ‘H’, ‘A’ and ‘MOVE_MARS’.
• Initialize a bool varia...read more
Answered by CodingNinjas
View 2 more amswers
Q3. Maximize the sum
You are given two sorted arrays of distinct integers, ‘ARR1’ and ‘ARR2’. If you find a common element in both arrays, you can switch from one array to another.
Your task is to find a pat...read more
Ans. Recursive
In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively. 
 
Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...read more
Answered by CodingNinjas
View 2 more amswers
Q4. Valid Pairs
You are given an array 'ARR' of 'N' integers and two integers 'K' and 'M'.
You need to return true if the given array can be divided into pairs such that the s...read more
Ans. Brute Force
Approach:  
 
1. Check the length of the array if it is odd then you can’t make pairs. Thus, return false.
2. Create a boolean array ‘VISTED’ of length ‘N’ initialized to false, which will store true if the element of the given array at that particular index is paired up already or not.
3. For each element of the array, try to pair up with each other element of the array.
   1. If both the elements are not paired...read more
Answered by CodingNinjas
View 2 more amswers
Q5. Prime Time Again
You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total in...read more
Ans. Brute Force
• This is a Naive/Brute Force approach
• Create a 2-d array of size ‘P’ rows and ‘D/P’ columns and assign 1 to ‘D’ value in each cell.
• Take an example with ‘D’ being 12 and ‘P’ being 2, then create an array [  [1,2,3,4,5,6]  [7,8,9,10,11,12]  ]
• Keep track of the number of prime group instances using a ‘PRIME_GROUP’ variable, which would be initialized to 0.
• We can easily observe that each column in th...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 30 Minutes
Round difficulty - Easy

As this was technical round , they asked me about the coding problems that i solved and asked me to explain.
And they asked some DSA topics , explained.
Then they gave on problem and said to write code for it, then i wrote it.
By this i completed my TR

Q1. Prime Time Again
You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total in...read more
Ans. Brute Force
• This is a Naive/Brute Force approach
• Create a 2-d array of size ‘P’ rows and ‘D/P’ columns and assign 1 to ‘D’ value in each cell.
• Take an example with ‘D’ being 12 and ‘P’ being 2, then create an array [  [1,2,3,4,5,6]  [7,8,9,10,11,12]  ]
• Keep track of the number of prime group instances using a ‘PRIME_GROUP’ variable, which would be initialized to 0.
• We can easily observe that each column in th...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 180 Minutes
Round difficulty - Medium

this round consists of 4 sections in which
3 are based on aptitude, reasoning and verbal.
other consists of programming logic and two coding questions.

Q1. Find Duplicates In Array
You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. You...read more
Ans. Sorting
1. The most trivial approach would be to sort the array/list ‘ARR’ and then return the duplicates.
2. After sorting the array in non-decreasing order, do the following for all the elements from i = 0 to i = n - 2:
   • If ARR[i] == ARR[i + 1], then add ARR[i] to the the output list.
   • While ARR[i] == ARR[i + 1], do i = i + 1, since we don’t want to add the same duplicate elements again and again.
   • Else continue.
3. After this loop, w...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 20 Minutes
Round difficulty - Medium

interview was conducted online through meetings

Q1. Basic HR Questions
Who is your role model?
Where do you see yourself in 5 years?
Add your answer