TCS iON Software Developer Intern Interview Questions, Process, and Tips

Round duration - 90 mintues
Round difficulty - Easy

The round contain 20 MCQ and 2 coding questions.

Q1. 
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 the number of candies left after providing 'K' candies to a customer.
• Check if 'K' is greater than 'N', return -1 if invalid

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

• Output the remaining candies for each test case
Answered by AI
Add your answer
Q2. 
Fitness Test in Indian Navy Problem Statement
The selection process in the Indian Navy includes a fitness test conducted in seawater, where a group of 3 trainees undergo a swimming test over three rounds....read more
Ans. 
Calculate average oxygen levels of trainees in Indian Navy fitness test and select fittest based on rules.
• Parse input to get oxygen levels of trainees after each round

• Calculate average oxygen level for each trainee over three rounds

• Select trainee(s) with highest average oxygen level, considering tie and fitness rules

• Print the fittest trainee(s) in increasing order or 'Unfit' if average level is below 70
Answered by AI
Add your answer

Round duration - 45 mintues
Round difficulty - Easy

Easy question where asked basic type like what is difference between inteprator and compiler. Method to prevent deadlock and best way to implement Fibonacci series.

Q1. 
Nth Element Of Modified Fibonacci Series
Given two integers X and Y as the first two numbers of a series, and an integer N, determine the Nth element of the series following the Fibonacci rule: f(x) = f(x...read more
Ans. 
Calculate the Nth element of a modified Fibonacci series given the first two numbers and N, with the result modulo 10^9 + 7.
• Implement a function to calculate the Nth element of the series using the Fibonacci rule f(x) = f(x - 1) + f(x - 2)

• Return the answer modulo 10^9 + 7 as the result may be very large

• The series is 1-based indexed, and the initial numbers X and Y can be between -10^6 and 10^6

• Handle up to 100 test case
Answered by AI
Add your answer
Q2. 
Reverse Alternate Nodes in a Singly Linked List
Given a singly linked list of integers, you need to reverse alternate nodes and append them to the end of the list.
Example:
Input:
1->2->3->4
...read more
Ans. 
Reverse alternate nodes in a singly linked list and append them to the end of the list.
• Traverse the linked list and reverse alternate nodes while keeping track of odd and even indices.

• Append the reversed alternate nodes to the end of the list.

• Handle edge cases like empty list or single node list.

• Consider using two pointers to keep track of the nodes to be reversed.
Answered by AI
Add your answer