'Coding has over 700 languages', '67% of programming jobs arenâ€™t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Tata Consultancy Services (TCS) interview experience Real time questions & tips from candidates to crack your interview
Trainee Technology
Tata Consultancy Services (TCS)
2 rounds | 4 Coding problems
Interview preparation journey
Preparation
Duration: 3 months
Topics: Patterns, Pointers, Searching, Sorting, Basics of computer networking
Tip

Tip 1 : Have a good grasp on the project topics mentioned in the resume.
Tip 2 : Machine Learning projects are a big plus.

Application process
Where: Campus
Eligibility: Minimum 60% with no standing backlog and maximum academic gap of 24 months till the date of application.
Resume tip

Tip 1 : Please only mention the things you really know about. It's very important.
Tip 2 : Machine learning projects in the resume is a big plus.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration180 minutes
Interview date17 Oct 2020
Coding problem2

The exam was conducted from home via the software designed by TCS. The test consists of logical reasoning, Verbal Ability, Numerical Ability, Programming Logic questions. It was a medium level difficulty test.

1. Reverse DLL nodes in groups
Moderate
10m average time
90% success
0/80

#### You are given a Doubly Linked List of integers and a positive integer 'K' representing the group size. Modify the linked list by reversing every group of 'K' nodes in the linked list.

View more
Problem approach

Step 1 : It was a variation of a standard rotating linked list problem.

Step 2 : I took the idea of the rotate linked list problem via iteration.

Step 3 : I used a temp variable to store the current node and previous node and using the loop, I iterated over all nodes of the doubly linked list.

2. Sort 0 1 2
Easy
22m average time
0/40

#### You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

##### Note :
View more
Problem approach

Step 1 : I used the two pointer approach.
Step 2 : I collected all the zero's on the left indices of the array and all the 1's on the right side of the array.
Step 3 : After iterating over all the elements of the array, my whole array was sorted in linear time complexity.

02
Round
Easy
Face to Face
Duration40 minutes
Interview date9 Nov 2020
Coding problem2

The interview was scheduled in the day. The interviewer asked some HR type questions although it was my technical interview. Salary expectations, work location choices, management questions, etc. formed a big part of the interview. Then typical questions around the concept of OOPS, networking, DBMS fill the remaining time.
Questions like searching and sorting and projects were focused in the other half of the interview.

1. Merge Sort
Easy
15m average time
85% success
0/40

#### Example :

View more
Problem approach

Step1 : This is a standard divide and conquer problem.

Step2 : I explained the general idea behind the algorithm and coded as per the standard algorithm

Step3 : I also explained why it's one of the best sorting algorithms while coding my way.

2. Sorted Linked List to Balanced BST
Moderate
25m average time
70% success
0/80

#### You have been given a singly linked list in which nodes are present in increasing order. Your task is to construct a Balanced Binary Search Tree with the same data elements as the given Linked L...

View more
Problem approach

Practise questions like this

Start a Discussion
Similar interview experiences
System Engineer
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
0 views
System Engineer
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
402 views
SDE - 1
3 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
287 views