Filter interviews by
I applied via Campus Placement and was interviewed in Sep 2021. There were 3 interview rounds.
Solution for overlapping intervals and concatenation of numbers to form the biggest number possible
For overlapping intervals, sort the intervals based on their start time and merge them if they overlap
For concatenation of numbers, sort the numbers in descending order of their concatenated form
Use a custom comparator function to sort the numbers based on their concatenated form
Answering a technical interview question on stack and linked list operations.
To find the minimum element in a stack in O(1), we can maintain a separate stack to keep track of the minimum element at any given point.
To merge two sorted linked lists, we can use a simple iterative approach where we compare the elements of both lists and add them to a new list in sorted order.
Alternatively, we can use a recursive approach w...
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
Top trending discussions
I applied via Naukri.com and was interviewed before May 2018. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2020. There were 4 interview rounds.
I faced a critical project deadline with unexpected technical challenges, requiring quick problem-solving and team collaboration.
Led a team during a major software deployment that faced unexpected bugs just days before launch.
Implemented a rapid response strategy, organizing daily stand-ups to address issues in real-time.
Collaborated with cross-functional teams to identify root causes and develop effective solutions.
Su...
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
It was very good
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
Use dynamic programming to check if substrings are palindromes
Iterate through the string and expand around each character to find palindromic substrings
Keep track of the longest palindromic substring found
You are given a 2D matrix 'ARR' of size 'N x 3' with integers, where 'N' is the number of rows. Your task is to compute the smallest sum achievable by selecting one...
Find the smallest sum achievable by selecting one element from each row of a 2D matrix, following certain constraints.
Iterate through each row and calculate the minimum sum by selecting elements that do not violate the constraints.
Keep track of the minimum sum achieved so far.
Avoid selecting elements directly beneath previously selected elements.
Example: For input [[1, 2, 3], [4, 8, 6], [1, 5, 3]], the optimal selectio...
Round duration - 1 hour
Round difficulty - Medium
It was a good interview
Tip 1 : Daily practice programming
Tip 2 : Work with honesty
Tip 3 : Do with utmost dedication
Tip 1 : Write with honesty
Tip 2 : Mention about your achievements
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
I applied via Walk-in and was interviewed in Dec 2020. There were 3 interview rounds.
The question is unclear and lacks context.
Please provide more information about the 'update shuttering system'.
Specify the time frame for the updates.
Clarify the purpose or objective of the updates.
Provide any relevant examples or scenarios.
I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.
Thre are aptitude question with coding round
I appeared for an interview in Oct 2020.
Round duration - 60 minutes
Round difficulty - Medium
Coding Test. This round was held on TCS own platform. The same platform is used for TCS Codevita. There were two questions in this test.
1. This was an easy level question based on Math.
2. This was a medium level question based on string manipulation
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...
Implement a function to encode a text message using run-length encoding.
Iterate through the message and count consecutive characters
Append the character and its count to the encoded message
Handle edge cases like single characters or empty message
You are provided with an array NUM
containing N
positive integers. Your objective is to find the total number of possible sequences of positive integers (g...
Count the total number of possible sequences of positive integers whose product equals X.
Calculate the product X using the given formula
Find all the divisors of X
Count the number of sequences with product X by considering the divisors
Round duration - 30 minutes
Round difficulty - Medium
Tip 1 : Be thorough with your basics - Data Structures and Algorithms, Pointers, DBMS,OOPS,OS etc.
Tip 2 : Practice Competitive Programming. Improve your programming skills. (Take data structures course from CN. That's enough for cracking any service based or product based company). Practice questions from Leetcode/Codechef/Codeforces.
Tip 3 : Be confident in your answers. You should not fumble while giving answers.
Tip 4: Also have a good practice on aptitude. Managing time during the test is also an important skill.
Tip 5: Have good projects on recent technologies(ML/Web D/Blockchain/Analytics etc). Have in depth knowledge about the project as the interviewer can go deep and can ask difficult questions on projects as well.
Tip 6: Start your preparation as early as possible and work on your communication skills as well.
Tip 1: Mention good projects.
Tip 2: Write the things about which you're 100% sure that you can answer questions from those things.
Tip 3: Do not try to go high profile by mentioning too many skills/projects/extra curriculars on resume.
based on 3 reviews
Rating in categories
Software Engineer
20
salaries
| ₹9 L/yr - ₹22 L/yr |
Senior Software Engineer
15
salaries
| ₹14 L/yr - ₹32.2 L/yr |
Data Analyst
11
salaries
| ₹5 L/yr - ₹11 L/yr |
Data Engineering Analyst
11
salaries
| ₹6.5 L/yr - ₹9.8 L/yr |
Softwaretest Engineer
8
salaries
| ₹4.7 L/yr - ₹7.2 L/yr |
Quess
ITC Infotech
Swiggy
L&T Construction