Tata Consultancy Services (TCS) interview experience Real time questions & tips from candidates to crack your interview
System Engineer
Tata Consultancy Services (TCS)
2 rounds | 5 Coding
problems
Selected Interview preparation journey
Journey
I was not getting any offer after giving many interviews. Then , in December 2023 , I came to know that TCS is offering prime role first time. I was excited for it . Then I gave NQT exam and solved two coding exam and I was called for the prime interview and then I got my offer.
Application story
TCS had presentation in our college and they asked us to apply on portal. I had applied on the company's portal.
Why selected/rejected for the role?
I had research paper in my resume which was based on project and that was published in well known publication and I explained problems given by the interviewer.
Preparation
Duration: 2 months
Topics: DSA, DBMS, OS, OOPS, Networking
Tip 1: Solve easy and medium level coding questions.
Tip 2: Basics of computer should be clear.
Application process
Where: Campus
Eligibility: 7 CGPA, (Salary package: 9 LPA)
Tip 1: Mention at least two latest tech projects.
Tip 2: Learn and highlight a unique technology to differentiate yourself from the competition..
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date15 Jan 2024
Coding problem2
Around 50 MCQs on aptitude and English communication and 2 coding problems came in the online assessment.
1. Find prime numbers
Easy
15m average time
80% success
0/40
Asked in companies
You are given a positive integer N, return the sum of all prime numbers between 1 and N(inclusive).
Problem approach
step1 -Define a function that takes an integer N as input.
step 2-Create a helper function to check if a number is prime.
step 3- A prime number is only divisible by 1 and itself.
step 4-Check divisibility from 2 to sqrt(n).
step 5-Iterate through numbers from 1 to N, check if they are prime.
step 6-Sum up all prime numbers found in the range.
step7 -Return the sum as output
2. Remove All Occurrences
Easy
0/40
Asked in company
Given an integer array arr[] and an integer ele the task is to the remove all occurrences of ele from arr[] in-place and return the number of elements which are not equal to ele. If there are k number of elements which are not equal to ele then the input array arr[] should be modified such that the first k elements should contain the elements which are not equal to ele and then the remaining elements.
Problem approach
1)Initialize j to 0. This will track the count of the elements not equal to ele.
2)Iterate over each element in the array using the loop with the index i.
3)f arr[i] is not equal to the ele, set arr[j] = arr[i] and increment j.
4)Return j.
02
Round
Medium
Face to Face
Duration40 minutes
Interview date15 Feb 2024
Coding problem3
1. Puzzle
Two trains are on same track and they are coming toward each other. The speed of the first train is 50 km/h and the speed of the second train is 70 km/h. A bee starts flying between the trains when the distance between two trains is 100 km. The bee first flies from first train to second train. Once it reaches the second train, it immediately flies back to the first train … and so on until trains collide. Calculate the total distance travelled by the bee. Speed of bee is 80 km/h.
2. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string s, find the length of the longest substring with all distinct characters.
Problem approach
1)Initialize: Set left = 0, max_length = 0, and an empty set.
2)Expand right pointer: If s[right] is in set, remove s[left] and move left.
3)Update max: Store the max substring length.
4)Repeat until the end of s.
5)Return max_length
3. 3Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Given an array arr[] and an integer target, determine if there exists a triplet in the array whose sum equals the given target.
Return true if such a triplet exists, otherwise, return false.
Problem approach
1)Sort the array arr[].
2)Loop through each element arr[i] (fix one element).
3)Use Two Pointers: Set left = i + 1, right = n - 1.
4)Check Sum:
If arr[i] + arr[left] + arr[right] == target, return true.
If sum < target, move left right.
If sum > target, move right left.
5)Repeat until left < right.
6)Return false if no triplet is found.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which traversal uses a queue as its primary data structure?
Choose another skill to practice
Similar interview experiences
System Engineer
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 
0 views
0 comments
0 upvotes
System Engineer
4 rounds | 10 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 770 views
0 comments
0 upvotes
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 1742 views
0 comments
0 upvotes
System Engineer
2 rounds | 2 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
155 views
0 comments
0 upvotes
Companies with similar interview experiences
System Engineer
2 rounds | 2 problems
Interviewed by Cognizant
Selected 4381 views
5 comments
0 upvotes
System Engineer
3 rounds | 5 problems
Interviewed by Infosys
Selected 2714 views
0 comments
0 upvotes
System Engineer
2 rounds | 1 problems
Interviewed by Infosys
Selected 3267 views
2 comments
0 upvotes