Tata consultancy services Ltd interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Tata consultancy services Ltd
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 Months
Topics: Data Structures, Algorithms, OOPS, Dynamic Programming
Tip 1 : Practice popular questions from Arrays, Binary Trees, LinkedLists from CodeStudio's Interview Problems
Tip 2 : Make sure you are aware of calculating the time and space complexity for every problem you're coding.
Tip 3 : Prepare through Mock Interviews to practice explaining your approach while solving in an actual interview.
Application process
Where: Company Website
Eligibility: Above 7 CGPA
Tip 1 : Describe best of your projects in minimum words. Don't forget to add buzz words like REST APIs/ DB Indexing/ Benchmarking etc if you worked on backend.
Tip 2 : Don't add school achievements like Olympiads or Class Topper in your resume.
Tip 3 : If you've some work experience, put it in a way ,you're marketing yourself. Add terms like 'Created/Owned the Project through entire SDLC'
Tip 4 : Make sure you mention how your work experience actually impacted the company. Or how your self project can be actually useful to end user.
Interview rounds
01
Round
Easy
Video Call
Duration45 Minutes
Interview date12 Mar 2022
Coding problem2
1. Minimum Sum in matrix
Moderate
15m average time
85% success
0/80
Asked in companies
You are given a 2D matrix ‘ARR’ of size ‘N x 3’ having integers, where ‘N’ is the number of rows.
Your task is to find the smallest sum possible while taking one element from each row.
The rules for selecting elements are as follows-
1. In a row, after selecting an element at a given position, you cannot select the element directly below it
2. You can only select elements that are not directly below the previously selected element.
Problem approach
You are given a 2D matrix ‘ARR’ of size ‘N x 3’ having integers, where ‘N’ is the number of rows.
Your task is to find the smallest sum possible while taking one element from each row
2. Rotate array
Easy
25m average time
80% success
0/40
Asked in companies
Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.
Example:
'arr '= [1,2,3,4,5]
'k' = 1 rotated array = [2,3,4,5,1]
'k' = 2 rotated array = [3,4,5,1,2]
'k' = 3 rotated array = [4,5,1,2,3] and so on.
Problem approach
Given an array with N elements, the task is to rotate the array to the left by K steps, where K is non-negative.
02
Round
Easy
HR Round
Duration30 Minutes
Interview date12 Mar 2022
Coding problem1
1. Basic HR questions
What is your preferred Job Location?
Are you comfortable with night shifts?
Have you got any other offers?
Problem approach
Tip 1 : Don't Hesitate to clarify any doubt if not been able to understand .
Tip 2 : Speak Confidently and clearly. without any pressure
Tip 3 : Join the meeting 10-15 mins prior and check if you have a stable internet connection if interview is conducted virtually.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which SQL clause is used to specify the conditions in a query?
Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Tata consultancy services Ltd
Selected 
1221 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Tata consultancy services Ltd
Selected 0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 2 problems
Interviewed by Tata consultancy services Ltd
Selected 1081 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Tata consultancy services Ltd
Selected 1584 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 113896 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57279 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34687 views
6 comments
0 upvotes