New update is available. Click here to update.

Tata Consultancy Services (TCS) Interview Experience for Fresher SDE - 1, Feb 2020

Posted: 3 Dec 2022

Selected

Interview Rounds

Application Process

Round 1

Round 2

Round 3

Interview Process

Online Coding Interview

Easy

Duration:

60 minutes

Interview-Date:

1 Feb 2020

Problems:

Longest Common Subsequence

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

Try Problem

See my Approach

Maximum Subarray Sum

You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.

Try Problem

See my Approach

Preparation

Duration:

3 months

Topics:

Data Structures, Algorithms, React, Java, OOPS

Preparation Tip

Tip 1 : Do at least 4 projects
Tip 2 : Understand time and space complexity calculation

Application Process

Where:

Campus

Eligibility:

Above 7 CGPA

Resume Tip

Tip 1 : Have multiple full stack projects in your resume
Tip 2 : Competitive programming ranks can be plus point

0 upvotes

Have an interview experience that you want to contribute?

PreviousNext

Start a Discussion

Tata Consultancy Services (TCS) Mock Interviews

For college students & professionals looking to get into Tata Consultancy Services (TCS)

Similar Experiences

Tata Consultancy Services (TCS) | Fresher

Tata Consultancy Services (TCS) | Fresher

Tata Consultancy Services (TCS) | Fresher

Tata Consultancy Services (TCS) | Fresher

Categories:

Coding courses for beginners |

Web Development Courses |

Data Science & Machine Learning Courses |

Competitive Programming Course |

Android App Development Courses |

Courses for interview preparation

Popular Courses:

C++ Foundation with Data Structures |

Java Foundation with Data Structures |

Python Foundation with Data Structures |

Competitive Programming |

Full Stack Web Development

Career Tracks:

Ninja Competitive Programmer Track |

Ninja Android Developer Career Track |

Ninja Web Developer Career Track - NodeJS & ReactJs |

Ninja Web Developer Career Track - NodeJS |

Ninja Data Scientist Career Track |

Ninja Machine Learning Engineer Career Track

Tata Consultancy Services (TCS) Interview Experience for Fresher SDE - 1, Feb 2020

Interview Process

Online Coding Interview

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.

Preparation

Application Process

Similar Experiences

Interested in Coding Ninjas Flagship Courses?