TCS Interview Questions, Process, and Tips

Round duration - 180 minutes
Round difficulty - Medium

My slot was on between 8.00am to 11.00am. It was a nice experience. The test was conducted through online. this was my first time writing online so i was afraid but the environment was very nice. it was a camera protected test. It included Aptitude, Reasoning and verbal with coding question. Aptitude was somewhat tricky among all. Other than that everything was medium level. They gave online calculator for that. coding was not that difficult. For coding we need to have basic knowledge of languages. overall it was not much difficult and not easy also.

Q1. 
Factorial Calculation Problem
Given an integer N, determine the factorial value of N. The factorial of a number N is the product of all positive integers from 1 to N.
Input:
First line of input: An inte...read more
Ans. 
Calculate the factorial of a given integer N.
• Iterate from 1 to N and multiply each number to get the factorial value.

• Handle edge cases like N=0 or N=1 separately.

• Use recursion or iteration to calculate the factorial value.
Answered by AI
Add your answer
Q2. 
Jar of Candies Problem Statement
You are given a jar containing candies with a maximum capacity of 'N'. The jar cannot have less than 1 candy at any point. Given 'K', the number of candies a customer want...read more
Ans. 
Given a jar with 'N' candies, determine how many candies remain after providing 'K' candies to a customer.
• Check if 'K' is greater than 'N', if so return -1

• Subtract 'K' from 'N' to get the remaining candies

• Return the remaining candies for each test case
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Medium

The total timing was 20 min. They asked wide range of questions here from DBMS, python, Data structures etc. the interviewer was friendly.

Round duration - 10 minutes
Round difficulty - Easy

The round was to know about our behaviour. the interviewer was friendly and interactive.

Round duration - 180 Minutes
Round difficulty - Medium

The round was in early morning ,Timing was from 8 .00 am on wards. There were proper protection due to covid-19 pandemic.The invigilators were friendly .the round was divided into two tests .1st two hours were for Aptitude,logical and verbal part.the other one hour was for Technical MCQs and coding problems.

Q1. 
Distance Greater Than K Problem Statement
You are provided an undirected graph, a source vertex, and an integer k. Determine if there is any simple path (without any cycle) from the source vertex to any o...read more
Ans. 
Check if there is a path from source vertex to any other vertex with distance greater than k in an undirected graph.
• Use Depth First Search (DFS) to traverse the graph and keep track of the distance from the source vertex.

• If at any point the distance exceeds k, return true.

• If DFS traversal completes without finding a path with distance greater than k, return false.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

The round consisted of HR and TR and MR on the same panel . First 25 minutes questions were asked from TR and after that MR asked just one question and then 15 minutes questions were asked by HR.

Q1. 
Middle of a Linked List
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...read more
Ans. 
Return the middle element of a singly linked list, or the one farther from the head node in case of even number of elements.
• Traverse the linked list using two pointers, one moving at twice the speed of the other.

• When the faster pointer reaches the end, the slower pointer will be at the middle.

• Return the element pointed to by the slower pointer.
Answered by AI
Add your answer

Resoning , general

Aptitude questions will be medium level.but time matters here.
Solving them within the given timespan is important.

Coding questions will be medium level.practice previous assessment questions helps a lot

Q1. In Techincal they will discuss more on basics only
Add your answer
Q2. From Java what is friend function
Ans. 
Friend function is not a concept in Java.
• Friend function is a concept in C++ where a non-member function can access private and protected members of a class.

• Java does not have the concept of friend function.

• In Java, access to private and protected members of a class is restricted to the class itself and its subclasses.
Answered by AI
Add your answer
Q3. Asked more on Oops concepts
Add your answer