TCS Software Developer Interview Questions, Process, and Tips

Very good Amazing Quite Challenging

Q1. What do you have any questions
Add your answer
Q2. How to get the latest version
Ans. 
To get the latest version, check the official website or app store for updates.
• Check the official website or app store for updates

• Look for release notes or changelogs to see what's new

• Consider subscribing to the software's newsletter or social media for announcements
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

There were two questions one from arrays and other one from linked list.

Q1. 
Longest Switching Subarray Problem Statement
You are provided with an array 'ARR' consisting of 'N' positive integers. Your task is to determine the length of the longest contiguous subarray that is switc...read more
Ans. 
Find the length of the longest contiguous subarray where elements at even indices are equal and elements at odd indices are equal.
• Iterate through the array and keep track of the length of the current switching subarray.

• Update the length when the switching condition is broken.

• Return the maximum length found for each test case.
Answered by AI
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Use Floyd's Cycle Detection Algorithm to determine if there is a cycle in the linked list.

• Maintain two pointers, one moving at twice the speed of the other, if they meet at some point, there is a cycle.

• If one of the pointers reaches the end of the list (null), there is no cycle.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

The interviewer was quite friendly. Asked general HR questions .

Basic Aptitude based test with coding questions

Q1. Discussion related to Project work
Add your answer
Q2. Difference b/w sorting Algorithm
Ans. 
Sorting algorithms arrange data in a specific order.
• Bubble Sort: repeatedly swap adjacent elements if they are in the wrong order

• Selection Sort: find the smallest element and swap it with the first element, repeat for remaining elements

• Insertion Sort: insert each element into its proper place in a sorted subarray

• Merge Sort: divide the array into two halves, sort each half, and merge them together

• Quick Sort: choose a pi...read more
Answered by AI
Add your answer

Q1. Are you willing to work in Shifts ?
Add your answer
Q2. Are you willing to commute to different locations for work ?
Add your answer

It was a basic quantitative reasoning aptitude test. Difficulty level was medium.

Coding test was kind of challenging for freshers. Difficulty level was medium to hard.

Q1. Explain the functionality of linked list
Ans. 
Linked list is a data structure that stores elements in a linear order and allows dynamic memory allocation.
• Consists of nodes that contain data and a pointer to the next node

• Can be singly or doubly linked

• Insertion and deletion can be done efficiently

• Traversal is slower compared to arrays

• Examples: stack, queue, hash table
Answered by AI
Add your answer
Q2. What are the 4 basic principles of OOPS?
Ans. 
The 4 basic principles of OOPS are Abstraction, Encapsulation, Inheritance, and Polymorphism.
• Abstraction: Hiding complex implementation details and showing only necessary information.

• Encapsulation: Binding data and functions together and restricting access to them.

• Inheritance: Creating new classes from existing ones, inheriting properties and methods.

• Polymorphism: Ability of objects to take on multiple forms or behavio
Answered by AI
Add your answer

Best wishes to you know that you have to come to the day da

Hi sir I have sent the best for first year and all the best for your reference