TCS LeetCode Interview Questions
Practice 253 coding problems currently tagged to TCS. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at TCS
Ace your TCS interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
TCS Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Friday Purchases I 100% | MediumM | Solve→ |
Two Sum 89% | EasyE | Solve→ |
Longest Palindromic Substring 82% | MediumM | Solve→ |
Palindrome Number 80% | EasyE | Solve→ |
Maximum Subarray 73.6% | MediumM | Solve→ |
Container With Most Water 72% | MediumM | Solve→ |
Move Zeroes 72% | EasyE | Solve→ |
Best Time to Buy and Sell Stock 70.3% | EasyE | Solve→ |
Longest Common Prefix 68.5% | EasyE | Solve→ |
Rank Transform of an Array 67.5% | EasyE | Solve→ |
Majority Element 66.4% | EasyE | Solve→ |
Second Highest Salary 66.4% | MediumM | Solve→ |
Valid Anagram 66.4% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 64.1% | MediumM | Solve→ |
Roman to Integer 64.1% | EasyE | Solve→ |
3Sum 64.1% | MediumM | Solve→ |
Valid Parentheses 64.1% | EasyE | Solve→ |
First Missing Positive 64.1% | HardH | Solve→ |
Find the Index of the First Occurrence in a String 62.8% | EasyE | Solve→ |
Sort Colors 62.8% | MediumM | Solve→ |
Single Number 62.8% | EasyE | Solve→ |
Reverse String 62.8% | EasyE | Solve→ |
Fibonacci Number 62.8% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 61.5% | EasyE | Solve→ |
Integer to Roman 61.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reverse Integer 60% | MediumM | Solve→ |
Merge Sorted Array 60% | EasyE | Solve→ |
Median of Two Sorted Arrays 60% | HardH | Solve→ |
Spiral Matrix 58.5% | MediumM | Solve→ |
Jump Game 58.5% | MediumM | Solve→ |
Rotate Array 58.5% | MediumM | Solve→ |
Contains Duplicate 58.5% | EasyE | Solve→ |
Subarray Sum Equals K 58.5% | MediumM | Solve→ |
Valid Palindrome 58.5% | EasyE | Solve→ |
Maximum Product Subarray 56.8% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 56.8% | EasyE | Solve→ |
Pow(x, n) 54.9% | MediumM | Solve→ |
First Unique Character in a String 54.9% | EasyE | Solve→ |
Group Anagrams 54.9% | MediumM | Solve→ |
Contains Duplicate II 54.9% | EasyE | Solve→ |
Zigzag Grid Traversal With Skip 54.9% | EasyE | Solve→ |
Task Scheduler 54.9% | MediumM | Solve→ |
Trapping Rain Water 52.8% | HardH | Solve→ |
Climbing Stairs 52.8% | EasyE | Solve→ |
Remove Letter To Equalize Frequency 52.8% | EasyE | Solve→ |
Count the Digits That Divide a Number 52.8% | EasyE | Solve→ |
Maximum Ascending Subarray Sum 52.8% | EasyE | Solve→ |
Maximum Product of Three Numbers 52.8% | EasyE | Solve→ |
Find First and Last Position of Element in Sorted Array 50.5% | MediumM | Solve→ |
Minimum Cuts to Divide a Circle 50.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Operations to Exceed Threshold Value I 50.5% | EasyE | Solve→ |
Minimum Operations to Exceed Threshold Value II 50.5% | MediumM | Solve→ |
Palindrome Partitioning IV 50.5% | HardH | Solve→ |
Search in Rotated Sorted Array 50.5% | MediumM | Solve→ |
Largest Rectangle in Histogram 50.5% | HardH | Solve→ |
Plus One 47.9% | EasyE | Solve→ |
Set Matrix Zeroes 47.9% | MediumM | Solve→ |
Sqrt(x) 47.9% | EasyE | Solve→ |
Longest Consecutive Sequence 47.9% | MediumM | Solve→ |
Add Binary 47.9% | EasyE | Solve→ |
Peak Index in a Mountain Array 47.9% | MediumM | Solve→ |
Bitwise ORs of Subarrays 47.9% | MediumM | Solve→ |
Merge Intervals 47.9% | MediumM | Solve→ |
Maximum Average Subarray I 47.9% | EasyE | Solve→ |
Add Two Numbers 45% | MediumM | Solve→ |
4Sum 45% | MediumM | Solve→ |
Length of Last Word 45% | EasyE | Solve→ |
Unique Paths 45% | MediumM | Solve→ |
Missing Number 45% | EasyE | Solve→ |
Single Element in a Sorted Array 45% | MediumM | Solve→ |
Toeplitz Matrix 45% | EasyE | Solve→ |
Sort an Array 45% | MediumM | Solve→ |
Search Insert Position 45% | EasyE | Solve→ |
Split Array With Same Average 45% | HardH | Solve→ |
Count Number of Pairs With Absolute Difference K 45% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
House Robber 45% | MediumM | Solve→ |
Duplicate Emails 45% | EasyE | Solve→ |
Smallest Sufficient Team 45% | HardH | Solve→ |
Burst Balloons 45% | HardH | Solve→ |
Letter Combinations of a Phone Number 45% | MediumM | Solve→ |
Squares of a Sorted Array 45% | EasyE | Solve→ |
Two Sum II - Input Array Is Sorted 45% | MediumM | Solve→ |
Employees Earning More Than Their Managers 45% | EasyE | Solve→ |
Kth Smallest Element in a BST 45% | MediumM | Solve→ |
Next Permutation 41.4% | MediumM | Solve→ |
Pascal's Triangle 41.4% | EasyE | Solve→ |
Happy Number 41.4% | EasyE | Solve→ |
Count Primes 41.4% | MediumM | Solve→ |
Reverse Linked List 41.4% | EasyE | Solve→ |
Sliding Window Maximum 41.4% | HardH | Solve→ |
Remove Nth Node From End of List 41.4% | MediumM | Solve→ |
Min Stack 41.4% | MediumM | Solve→ |
Middle of the Linked List 41.4% | EasyE | Solve→ |
Product Sales Analysis I 41.4% | EasyE | Solve→ |
Product of Array Except Self 41.4% | MediumM | Solve→ |
Generate Parentheses 37.1% | MediumM | Solve→ |
Subsets 37.1% | MediumM | Solve→ |
Diameter of Binary Tree 37.1% | EasyE | Solve→ |
Find the Duplicate Number 37.1% | MediumM | Solve→ |
Max Consecutive Ones 37.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Partition Equal Subset Sum 37.1% | MediumM | Solve→ |
N-Queens 37.1% | HardH | Solve→ |
Merge k Sorted Lists 37.1% | HardH | Solve→ |
Running Sum of 1d Array 37.1% | EasyE | Solve→ |
Tallest Billboard 37.1% | HardH | Solve→ |
Permutation in String 37.1% | MediumM | Solve→ |
Koko Eating Bananas 37.1% | MediumM | Solve→ |
Serialize and Deserialize Binary Tree 37.1% | HardH | Solve→ |
Search in Rotated Sorted Array II 37.1% | MediumM | Solve→ |
Subsets II 37.1% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 37.1% | MediumM | Solve→ |
String to Integer (atoi) 37.1% | MediumM | Solve→ |
Longest Palindromic Subsequence 37.1% | MediumM | Solve→ |
Remove Duplicates from Sorted List 37.1% | EasyE | Solve→ |
Longest Increasing Subsequence 37.1% | MediumM | Solve→ |
Palindrome Linked List 37.1% | EasyE | Solve→ |
Find Peak Element 37.1% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 31.7% | MediumM | Solve→ |
Reverse Words in a String 31.7% | MediumM | Solve→ |
Fizz Buzz 31.7% | EasyE | Solve→ |
K-diff Pairs in an Array 31.7% | MediumM | Solve→ |
Article Views I 31.7% | EasyE | Solve→ |
Jump Game II 31.7% | MediumM | Solve→ |
Ugly Number 31.7% | EasyE | Solve→ |
Minimum Moves to Equal Array Elements II 31.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
LRU Cache 31.7% | MediumM | Solve→ |
Delete the Middle Node of a Linked List 31.7% | MediumM | Solve→ |
Third Maximum Number 31.7% | EasyE | Solve→ |
Find Subsequence of Length K With the Largest Sum 31.7% | EasyE | Solve→ |
Longest Subarray of 1's After Deleting One Element 31.7% | MediumM | Solve→ |
Next Greater Element I 31.7% | EasyE | Solve→ |
Assign Cookies 31.7% | EasyE | Solve→ |
Reorder List 31.7% | MediumM | Solve→ |
Remove Element 31.7% | EasyE | Solve→ |
Managers with at Least 5 Direct Reports 31.7% | MediumM | Solve→ |
Non-overlapping Intervals 31.7% | MediumM | Solve→ |
Range Sum Query - Immutable 31.7% | EasyE | Solve→ |
Daily Temperatures 31.7% | MediumM | Solve→ |
Permutations 31.7% | MediumM | Solve→ |
Search a 2D Matrix 31.7% | MediumM | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 31.7% | EasyE | Solve→ |
String Compression 31.7% | MediumM | Solve→ |
Find Pivot Index 31.7% | EasyE | Solve→ |
Maximum Total Subarray Value I 31.7% | MediumM | Solve→ |
Top K Frequent Elements 31.7% | MediumM | Solve→ |
Minimum Depth of Binary Tree 31.7% | EasyE | Solve→ |
Delete Duplicate Emails 31.7% | EasyE | Solve→ |
Same Tree 31.7% | EasyE | Solve→ |
Consecutive Numbers 31.7% | MediumM | Solve→ |
Combine Two Tables 31.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Decode String 31.7% | MediumM | Solve→ |
Number of Islands 31.7% | MediumM | Solve→ |
Lemonade Change 31.7% | EasyE | Solve→ |
Find the Peaks 31.7% | EasyE | Solve→ |
Find Missing Elements 31.7% | EasyE | Solve→ |
Merge Two Sorted Lists 24.2% | EasyE | Solve→ |
Largest Number 24.2% | MediumM | Solve→ |
Power of Two 24.2% | EasyE | Solve→ |
Employee Bonus 24.2% | EasyE | Solve→ |
Binary Search 24.2% | EasyE | Solve→ |
Integer to English Words 24.2% | HardH | Solve→ |
Recyclable and Low Fat Products 24.2% | EasyE | Solve→ |
Maximal Rectangle 24.2% | HardH | Solve→ |
Divisor Game 24.2% | EasyE | Solve→ |
Project Employees I 24.2% | EasyE | Solve→ |
Majority Element II 24.2% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 24.2% | HardH | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 24.2% | MediumM | Solve→ |
Linked List Cycle 24.2% | EasyE | Solve→ |
Replace Employee ID With The Unique Identifier 24.2% | EasyE | Solve→ |
Check If Array Pairs Are Divisible by k 24.2% | MediumM | Solve→ |
Rotate Image 24.2% | MediumM | Solve→ |
Count the Number of Fair Pairs 24.2% | MediumM | Solve→ |
Return Length of Arguments Passed 24.2% | EasyE | Solve→ |
Remove All Occurrences of a Substring 24.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Repeated Substring Pattern 24.2% | EasyE | Solve→ |
Find the Original Typed String I 24.2% | EasyE | Solve→ |
Maximum Gap 24.2% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended II 24.2% | HardH | Solve→ |
Odd Even Linked List 24.2% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 24.2% | MediumM | Solve→ |
Subarray Product Less Than K 24.2% | MediumM | Solve→ |
Valid Word 24.2% | EasyE | Solve→ |
Maximum Nesting Depth of the Parentheses 24.2% | EasyE | Solve→ |
Linked List Cycle II 24.2% | MediumM | Solve→ |
Water Bottles 24.2% | EasyE | Solve→ |
Teemo Attacking 24.2% | EasyE | Solve→ |
Minimum Size Subarray Sum 24.2% | MediumM | Solve→ |
Binary Tree Inorder Traversal 24.2% | EasyE | Solve→ |
Smallest Integer Divisible by K 24.2% | MediumM | Solve→ |
Department Highest Salary 24.2% | MediumM | Solve→ |
How Many Numbers Are Smaller Than the Current Number 24.2% | EasyE | Solve→ |
Bulb Switcher 24.2% | MediumM | Solve→ |
Regular Expression Matching 24.2% | HardH | Solve→ |
Intersection of Two Arrays II 24.2% | EasyE | Solve→ |
Rotting Oranges 24.2% | MediumM | Solve→ |
Longest Balanced Substring II 24.2% | MediumM | Solve→ |
Count and Say 24.2% | MediumM | Solve→ |
Continuous Subarray Sum 24.2% | MediumM | Solve→ |
Longest Common Subsequence 24.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reshape the Matrix 24.2% | EasyE | Solve→ |
Zigzag Conversion 24.2% | MediumM | Solve→ |
Longest Palindrome 24.2% | EasyE | Solve→ |
Find the Winner of the Circular Game 24.2% | MediumM | Solve→ |
Intersection of Two Linked Lists 24.2% | EasyE | Solve→ |
Word Ladder 24.2% | HardH | Solve→ |
Remove Outermost Parentheses 24.2% | EasyE | Solve→ |
Min Cost Climbing Stairs 24.2% | EasyE | Solve→ |
Create Hello World Function 24.2% | EasyE | Solve→ |
Rotate String 24.2% | EasyE | Solve→ |
Find Smallest Letter Greater Than Target 24.2% | EasyE | Solve→ |
Find Numbers with Even Number of Digits 24.2% | EasyE | Solve→ |
3Sum Closest 24.2% | MediumM | Solve→ |
Insert Interval 24.2% | MediumM | Solve→ |
Sort Array By Parity 24.2% | EasyE | Solve→ |
Subtract the Product and Sum of Digits of an Integer 24.2% | EasyE | Solve→ |
Spiral Matrix II 24.2% | MediumM | Solve→ |
Find All Numbers Disappeared in an Array 24.2% | EasyE | Solve→ |
Contiguous Array 24.2% | MediumM | Solve→ |
Maximum Depth of Binary Tree 24.2% | EasyE | Solve→ |
Maximum Ice Cream Bars 24.2% | MediumM | Solve→ |
Remove Linked List Elements 24.2% | EasyE | Solve→ |
Reducing Dishes 24.2% | HardH | Solve→ |
Top K Frequent Words 24.2% | MediumM | Solve→ |
Count Odd Numbers in an Interval Range 24.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Ransom Note 24.2% | EasyE | Solve→ |
Fruit Into Baskets 24.2% | MediumM | Solve→ |
Max Number of K-Sum Pairs 24.2% | MediumM | Solve→ |
Nth Highest Salary 24.2% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 24.2% | HardH | Solve→ |
Find All Duplicates in an Array 24.2% | MediumM | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 24.2% | MediumM | Solve→ |
Asteroid Collision 24.2% | MediumM | Solve→ |
Next Greater Element II 24.2% | MediumM | Solve→ |
Swap Nodes in Pairs 24.2% | MediumM | Solve→ |
GCD of Odd and Even Sums 24.2% | EasyE | Solve→ |
Smallest Range Covering Elements from K Lists 24.2% | HardH | Solve→ |
Online Stock Span 24.2% | MediumM | Solve→ |
Factorial Trailing Zeroes 24.2% | MediumM | Solve→ |
Set Mismatch 24.2% | EasyE | Solve→ |
Kth Largest Element in an Array 24.2% | MediumM | Solve→ |
Subtree of Another Tree 24.2% | EasyE | Solve→ |
Search in a Binary Search Tree 24.2% | EasyE | Solve→ |
Boats to Save People 24.2% | MediumM | Solve→ |
Gas Station 24.2% | MediumM | Solve→ |
Minimum Number of Operations to Reinitialize a Permutation 24.2% | MediumM | Solve→ |
Maximum Product of Two Elements in an Array 24.2% | EasyE | Solve→ |
Minimum Number of Operations to Make Array Continuous 24.2% | HardH | Solve→ |
Nim Game 24.2% | EasyE | Solve→ |
Isomorphic Strings 24.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to TCS?
Our current TCS practice dataset contains 253 tagged coding problems, including Friday Purchases I, Two Sum, Longest Palindromic Substring. The difficulty breakdown is 113 Easy, 116 Medium, and 24 Hard problems.
How should I prepare for a TCS coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. TCS interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of TCS coding interviews?
Based on our data, TCS interviews include 113 Easy (45%), 116 Medium (46%), and 24 Hard (9%) problems.
Ready to ace your TCS interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required