TCS

TCS

Large multinational IT services and consulting enterprise based in India.

3 Rounds ~14 Days Medium
Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

Backend Engineer Coding easy

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

#Arrays #HashMaps
Backend Engineer Coding easy

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

#Stacks #Strings
Backend Engineer Coding medium

Write a program to group anagrams together from an array of strings.

#Strings #HashMaps
Backend Engineer Coding medium

Given an array of intervals, merge all overlapping intervals and return an array of the non-overlapping intervals.

#Arrays #Sorting
Backend Engineer Coding easy

Write a function to detect if a cycle exists in a singly linked list.

#Linked Lists #Two Pointers
Backend Engineer Coding medium

Given a string, find the length of the longest substring without repeating characters.

#Strings #Sliding Window
Data Scientist Coding easy

Write a Python function to detect if two strings are anagrams of each other, optimizing for time complexity.

#Strings #Hash Maps #Python
Data Scientist Coding medium

Given an array of integers, write a Python script to find the maximum sum of any contiguous subarray.

#Dynamic Programming #Kadane's Algorithm
Frontend Engineer Coding hard

Implement an LRU (Least Recently Used) Cache class in JavaScript with get() and put() methods operating in O(1) time complexity.

#Data Structures #Caching #Hash Maps #Linked Lists
Frontend Engineer Coding medium

Write a JavaScript function to flatten a deeply nested array without using the built-in Array.prototype.flat() method.

#Recursion #Arrays #Data Structures
Full Stack Engineer Coding medium

Write a program to find the longest substring without repeating characters.

#Strings #Sliding Window #Hash Map
Full Stack Engineer Coding easy

Given two strings, write a method to determine if they are valid anagrams of each other. Optimize for time and space complexity.

#Strings #Hash Map #Sorting
Full Stack Engineer Coding medium

Write a code to check if a given binary tree is a valid Binary Search Tree (BST).

#Trees #Recursion #DFS
Full Stack Engineer Coding easy

Write a function to reverse a linked list. Follow up: Can you do it recursively?

#Linked Lists #Pointers #Recursion
Full Stack Engineer Coding easy

Given an array of integers, write a function to move all zeros to the end while maintaining the relative order of the non-zero elements.

#Arrays #Two Pointers
Machine Learning Engineer Coding medium

Given a string representing a sequence of user actions, find the length of the longest substring without repeating characters.

#Sliding Window #Strings #Hash Map
Machine Learning Engineer Coding medium

Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals. This is often used in processing time-series data for sensor logs.

#Arrays #Sorting #Data Structures
Software Engineer Coding easy

Write a program to print the Fibonacci series up to N terms using recursion.

#Recursion #Math #Basic Programming
Software Engineer Coding easy

Given an array of size N containing distinct numbers in the range from 1 to N+1, find the single missing number.

#Arrays #Math #Bit Manipulation
Software Engineer Coding medium

Write a program to find the longest palindromic substring in a given string.

#Strings #Dynamic Programming #Expand Around Center
Software Engineer Coding easy

Given an array of integers and a target sum, return the indices of the two numbers that add up to the target. (Two Sum problem)

#Arrays #Hash Map
Software Engineer Coding hard

Given two sorted arrays, merge them into a single sorted array without using any extra space (O(1) auxiliary space).

#Arrays #Sorting #Math
Software Engineer Coding easy

Find the first non-repeating character in a given string and return its index. If it doesn't exist, return -1.

#Strings #Hash Map #Arrays
Software Engineer Coding medium

Write a program to detect a loop (cycle) in a singly linked list.

#Linked List #Floyd's Cycle-Finding Algorithm #Pointers
Software Engineer Coding medium

Write a program to reverse a string without using inbuilt functions, ensuring that special characters remain in their exact original positions.

#Strings #Two Pointers #Data Structures
Software Engineer Coding easy

Write a function to check if two given strings are anagrams of each other.

#Strings #Sorting #Hash Map

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now