TCS interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
TCS
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : OOPS - You should be well versed with basic OOPS principles
Tip 2 : You should be confident and have profound knowledge about the projects you worked on
Tip 3 : Basic DB concepts like joins, normalisation
Application process
Where: Other
Eligibility: Above 6 CGPA
Tip 1 : Have clean resume with projects mentioned separately
Tip 2 : Internships should be mentioned if done
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date24 Sep 2022
Coding problem2
1. Find prime numbers
Easy
15m average time
80% success
0/40
Asked in companies
You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.
Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.
You can assume that the value of N will always be greater than 1. So, the answer will always exist.
Problem approach
I used the Sieve of Eratosthenes. Created a sieve array whose size was equal to the maximum number in the array given. Then filled the sieve using the algorithm.
2. Subarray With Given Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.
Note:
If two or more such subarrays exist, return any subarray.
For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].
Problem approach
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.
02
Round
Easy
HR Round
Duration30 minutes
Interview date24 Sep 2022
Coding problem1
1. Basic HR Questions
- What are your skills that makes you relevant for this job profile?
- What makes you passionate about this company?
Problem approach
Told him about my tech-stack like MERN and Machine learning.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 6 problems
Interviewed by TCS
Rejected
1607 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by TCS
Selected 0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by TCS
Selected 1116 views
0 comments
0 upvotes
SDE - 1
2 rounds | 10 problems
Interviewed by TCS
Rejected
1294 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115096 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58237 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35146 views
7 comments
0 upvotes