TCS iON Technical Trainee Interview Questions, Process, and Tips

Round duration - 180 minutes
Round difficulty - Easy

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. 

Q1. 
Reverse Doubly Linked List Nodes in Groups
You are given a doubly linked list of integers along with a positive integer K that represents the group size. Your task is to modify the linked list by reversin...read more
Ans. 
Reverse groups of K nodes in a doubly linked list.
• Iterate through the linked list in groups of K nodes

• Reverse each group of K nodes

• Handle cases where the number of nodes is less than K

• Update the pointers accordingly
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an integer array containing only 0s, 1s, and 2s in-place using a single scan.
• Iterate through the array and maintain three pointers for 0s, 1s, and 2s.

• Swap elements based on the current element's value and the pointers.

• Example: If current element is 0, swap with the 0s pointer and increment both pointers.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

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.

Q1. 
Merge Sort Problem Statement
You are given a sequence of numbers, ARR. Your task is to return a sorted sequence of ARR in non-descending order using the Merge Sort algorithm.
Explanation:
The Merge Sort...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively until each array has only one element.

• Merge the sorted halves to produce a completely sorted array.

• Ensure the implementation handles the constraints specified in the problem statement.

• Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Answered by AI
Add your answer
Q2. 
Sorted Linked List to Balanced BST Problem Statement
Given a singly linked list where nodes contain values in increasing order, your task is to convert it into a Balanced Binary Search Tree (BST) using th...read more
Ans. 
Convert a sorted linked list into a Balanced Binary Search Tree (BST) using the same data values.
• Create a function to convert the linked list to a BST by recursively dividing the list into halves

• Maintain a pointer to the middle element of the list as the root of the BST

• Recursively set the left and right children of the root using the left and right halves of the list

• Perform level order traversal to output the values of
Answered by AI
Add your answer