Tata Consultancy Services (TCS) interview experience Real time questions & tips from candidates to crack your interview
SDE
Tata Consultancy Services (TCS)
3 rounds | 9 Coding
problems
Selected Interview preparation journey
Journey
As a programmer, my journey began with learning the basics of programming languages, algorithms, and data structures.From there, I worked on building more complex programs and applications, honing my skills in areas such as software design, debugging, and optimization. I also worked on personal projects and contributed to open-source projects to gain more experience and exposure.To prepare for job interviews, I studied common interview questions, practiced coding challenges, and read up on best practices for interviewing. When the time came for interviews, I made sure to showcase my skills and experience, while also being open and eager to learn from the interviewers.Overall, my journey from starting with the basics to cracking job interviews was a challenging but rewarding experience. It required a lot of hard work, dedication, and a willingness to constantly learn and improve.
Application story
I have applied TCS off campus through TCS nqt. .The job description was perfect for me- it required the exact skills that i have. Without hesitation, I applied for the job by submitting my resume online.A few days later, I received an email inviting me to take an online coding assessment to test my programming skills. I was nervous but determined to do my best, and I spent several hours studying and practicing before taking the assessment. I felt confident that I had performed well and eagerly awaited the company's response.A week later, I received an email from the hiring manager, who congratulated me on passing the coding assessment,and scheduled my technical interview.The day of the interview had arrived, and I was feeling both excited and nervous. I had prepared thoroughly for the interview and was eager to showcase my programming skills.After the interview, I felt both relieved and excited. I had done my best and had impressed the team with my technical skills and problem-solving abilities.A few days later, I received an email from the hiring manager, who congratulated me on a successful interview and offered the job. I was thrilled and accepted the offer, excited to start his my role as a programmer at the company.
Why selected/rejected for the role?
I impressed the hiring team with deep knowledge of computer concepts and programming languages. I was able to explain complex technical concepts in a clear and concise manner.Moreover, I remained calm and collected throughout the interview, even in the face of challenging technical questions.
Preparation
Duration: 3 months
Topics: Data structures and algorithms, Database design and management, Web development (HTML, CSS, JavaScript),Agile methodologies and project management, Software design patterns, Operating systems and computer architecture.
Tip 1 : Practice coding challenges and exercises, such as LeetCode, HackerRank, and CodeSignal.
Tip 2 : Research the company and position: Before the interview, it's important to research the company and the position you're applying for.
Tip 3 : Build projects: Building personal projects is a great way to gain practical experience and showcase your skills to potential employers.
Tip 4:Read up on core concepts: It's important to have a solid understanding of core programming concepts such as data structures, algorithms, object-oriented programming, and database design.
Application process
Where: Campus
Eligibility: No backlogs,Above 7CGPA, Certification in technologies, like Sql, Java, OOPS.
Tip 1 : Tailor your resume to the job: One of the most important tips for writing a great resume is to tailor it to the specific job you're applying for. This means carefully reviewing the job description and identifying the skills and experience that the employer is looking for. Then, you should highlight your relevant skills and experience in your resume, using keywords and phrases that match the job description. This will help your resume stand out to the employer and demonstrate that you have the skills and experience they're looking for.
Tip 2 : Use bullet points and quantifiable achievements: Another key tip for writing a great resume is to use bullet points and quantify your achievements wherever possible. This makes it easy for the employer to quickly scan your resume and see your most impressive accomplishments. For example, instead of saying "Managed a team of developers," you might say "Managed a team of 5 developers and delivered 3 major software projects on time and under budget." By using specific numbers and accomplishments, you can show the employer that you have a track record of success and are capable of making a meaningful contribution to their organization.
Tip 3 : Keep it concise: Employers don't have a lot of time to spend reading resumes, so it's important to keep yours concise and to the point. Aim for a maximum of two pages, and use bullet points and short, impactful sentences to convey your skills and experience.
Tip 4 : Use a professional format: Your resume should be well-organized and easy to read. Use a professional font and a clear, simple format that highlights your most important information. Avoid using too many graphics or colors, as these can be distracting and may not be compatible with all computer systems.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration120 minutes
Interview date15 Sep 2021
Coding problem3
1. Break Number
Moderate
35m average time
70% success
0/80
Asked in companies
Given a number 'N', you need to find all possible unique ways to represent this number as the sum of positive integers.
Note
1. By unique it is meant that no other composition can be expressed as a permutation of the generated composition. For eg. [1, 2, 1] and [1, 1, 2] are not unique.
2. You need to print all combinations in non-decreasing order for eg. [1, 2, 1] or [1, 1, 2] will be printed as [1, 1, 2], however, the order of printing all the sequences can be random.
2. Sort 0 1 2
Easy
22m average time
0/40
Asked in companies
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 :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach
Keep three indices low = 1, mid = 1, and high = N and there are four ranges, 1 to low (the range containing 0), low to mid (the range containing 1), mid to high (the range containing unknown elements) and high to N (the range containing 2).
Traverse the array from start to end and mid is less than high. (Loop counter is i)
If the element is 0 then swap the element with the element at index low and update low = low + 1 and mid = mid + 1
If the element is 1 then update mid = mid + 1
If the element is 2 then swap the element with the element at index high and update high = high – 1 and update i = i – 1. As the swapped element is not processed
Print the array
3. Puzzle Question
A tank is filled by three pipes with uniform flow. The first two pipes operating simultaneously fill the tank in the same time during which the tank is filled by the third pipe alone. The second pipe fills the tank 5 hours faster than the first pipe and 4 hours slower than the third pipe. The time required by the first pipe is:
Problem approach
Ans:- 15 hours
02
Round
Medium
Video Call
Duration30 minutes
Interview date20 Oct 2021
Coding problem5
DSA coding question was asked.
1. Two Sum
Easy
10m average time
90% success
0/40
Asked in companies
You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.
Note:
We cannot use the element at a given index twice.
Follow Up:
Try to do this problem in O(N) time complexity.
Problem approach
A simple solution is to traverse each element and check if there’s another number in the array which can be added to it to give sum.
This can be achieved by nested loops.
2. Middle Of Linked List
Easy
20m average time
80% success
0/40
Asked in companies
Given a singly linked list of 'N' nodes. The objective is to determine the middle node of a singly linked list. However, if the list has an even number of nodes, we return the second middle node.
Note:
1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
3. OOPS Question
What are 4 pillars of OOPS?
4. DBMS Question
Write SQL for 2nd highest salary in company.
5. DSA Question
Difference between inorder and postorder traversal.
03
Round
Easy
HR Round
Duration20 minutes
Interview date29 Oct 2021
Coding problem1
it was a HR cum Managerial round
1. Basic HR Questions
Tell me about yourself.
Tell me about your vision after 5 years.
Do you have any other offer?
Tell me about your strengths and weakness.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
SDE
2 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
1039 views
0 comments
0 upvotes
SDE
3 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 998 views
0 comments
0 upvotes
SDE
3 rounds | 5 problems
Interviewed by Tata Consultancy Services (TCS)
Rejected
1003 views
0 comments
0 upvotes
SDE
2 rounds | 6 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 2132 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE
4 rounds | 6 problems
Interviewed by HashedIn
Selected 710 views
0 comments
0 upvotes
SDE
2 rounds | 4 problems
Interviewed by Cognizant
Selected 918 views
0 comments
0 upvotes
SDE
2 rounds | 4 problems
Interviewed by HCL Technologies
Rejected
989 views
0 comments
0 upvotes