TCS SDE Sheet: Interview Questions and Answers Last Updated : 26 Jul, 2025 Comments Improve Suggest changes Like Article Like Report What is TCS NQT ? TCS NQT is National Qualifier Test conducted by Tata Consultancy Services, it is a prerequisite for all the tests. The validity of the NQT score is of two years. Candidates are eligible to apply on the TCS iON Job Listing Portal with an NQT score. NQT exams are conducted in both online and offline modes. This sheet will help you prepare for the TCS NQT exam & you can apply for all the top-notch companies that recognize the exam score. Here we have collected all the interview questions and answers to land a job at TCS. TCS SDE Sheet TCS NQT Syllabus Verbal Ability Aptitude & Reasoning Ability Programing Logic: Data Structures Algorithms OOPS Concepts Coding Section: Arrays String Number Series Conversions Sorting Algorithm Recommended PracticePractice for TCS InterviewTry It! What does this sheet Contains ? This article contains TCS coding questions i.e. the coding questions that are mostly asked in TCS hiring challenges on different topics. The questions are arranged topic-wise in this sheet along with their solutions. TCS Ninja and Digital profiles are selected on the basis of the TCS NQT test score. These two profiles differentiate the employees on the basis of coding and interview experience. TCS Digital: TCS Digital hires for the Digital Technology Domain, specializing in IoT, AI, ML, Big Data, Virtual Reality, BlockChain, NLP, etc. There are three ways of landing the TCS Digital offer. TCS Ninja: TCS Ninja profile is hired through TCS NQT test, based on the score you scored in NQT you will choose as Ninja. It offers package of 3.36 to 3.60. Verbal Ability: In TCS NQT there are 25 questions and the given time was 75 minutes to check your proficiency on English, like easy writing and questions answering. TCS Placement Paper | Email Writing Question 1 TCS Placement Paper | Email Writing Question 2 TCS Placement Paper | Email Writing Question 3 TCS Placement Paper | Email Writing Question 4 TCS Placement Paper | Email Writing Question 5 TCS Placement Paper | Email Writing Question 6 TCS Placement Paper | Email Writing Question 7 TCS Placement Paper | Email Writing Question 8 TCS Placement Paper | Email Writing Question 9 TCS Placement Paper | Email Writing Question 10 Aptitude & Reasoning Ability: Here in this Aptitude & Reasoning test the numerical and the reasoning ability sections are tested. We attached 10 set to practice yourself. TCS Placement Paper | MCQ 1 TCS Placement Paper | MCQ 2 TCS Placement Paper | MCQ 3 TCS Placement Paper | MCQ 4 TCS Placement Paper | MCQ 5 TCS Placement Paper | MCQ 6 TCS Placement Paper | MCQ 7 TCS Placement Paper | MCQ 8 TCS Placement Paper | MCQ 9 TCS Placement Paper | MCQ 10 Programming Logic: Your knowledge of C, C++, and Java is tested in the TCS NQT Programming Logic exam, but that is not its only purpose. To answer questions like OOPS, DSA, etc., you must have a solid grasp of computer science Concepts There are a sufficient number of Data Structures Problems. To prepare you for the test, let's first go through the fundamental guidelines Data Structures:A data structure is a storage that is used to store and organize data. It is used for processing, retrieving, and storing data. There are different basic and advanced types of data structures used in almost every program or software system that has been developed. Algorithms:Algorithm refers to a sequence of finite steps to solve a particular problem.The word Algorithm means ” A set of rules to be followed in calculations or other problem-solving operations ” Or ” A procedure for solving a mathematical problem in a finite number of steps that are frequently by recursive operations “. OOPS Concepts: As the name suggests, Object-Oriented Programming or OOPs refers to languages that use objects in programming, they use objects as a primary source to implement what is to happen in the code.Object-oriented programming aims to implement real-world entities like inheritance, hiding, polymorphism etc. Coding Section: In the Coding section of TCS NQT, they asked questions from the below-mentioned topics: Arrays: Here is the collection of the frequently asked interviews question on arrays in the TCS hiring test. Problems Practice Non-Repeating Element Solve Program for array rotation Solve Equilibrium index of an array Solve Print array after it is right rotated K times Solve Array is a subset of another array Solve Find all symmetric pairs from a pairs of array Solve Counting Rock Samples Solve Reverse an array or string Solve Mean and median of an unsorted array Solve Smallest and second smallest elements in an array Solve Largest element in an array Solve Second largest element in an array Solve Counting frequencies of array elements Solve Program for addition of two matrices Solve Sort a K-Increasing-Decreasing Array Solve Sum of elements in a given array Solve Remove duplicates from the sorted array Solve Program to check if an array is sorted or not Solve Remove duplicates from an unsorted array using Map data structure Solve Block swap algorithm for array rotation Solve Average of an array (Iterative and Recursive) Solve Add an element to an Array Solve Find duplicates in O(n) time and O(1) extra space Solve Find maximum possible stolen value from houses Solve Replace each element of the Array with it’s corresponding rank Solve Sort elements by frequency Solve Sort an array according to the order defined by another array Solve Maximum Product Subarray Solve String: Here is the collection of the frequently asked interviews question on strings in the TCS hiring test. Problems Practice Count vowels, consonants, digits, and special characters in a string Solve Given String is Palindrome or not Solve ASCII Value of a character Solve Remove vowels from a String Solve Remove spaces from a given string Solve Remove character Solve Remove all characters other than alphabets Solve Reverse a string Solve Sum of numbers in string Solve Capitalize first and last character of each word Solve Frequency of characters in a string Solve Non Repeating Character Solve Smallest and Largest Word in a String Solve Strings are anagram of each other Solve Sort string of characters Solve Convert characters of a string to opposite case Solve Count words in a given string Solve Encrypt the string Solve Remove duplicates from a given string Solve Duplicates in the input string Solve Lexicographically next string Solve Remove brackets from an algebraic expression Solve Check if a string is substring of another Solve Reverse words in a given string Solve Common subsequence in two strings Solve One string contains wildcard characters Solve Number Series: While a sequence is a list of items arranged in a sequential way following a particular relation, a series is the cumulative sum of a given sequence of terms. Problems Practice Prime Numbers Solve Sum of arithmetic series Solve Sum of geometric series Solve All divisors of a natural number Solve Replace all ‘0’ with ‘5’ in an input Integer Solve Number is Positive, Negative, Odd, Even, Zero Solve Harshad (Or Niven) Number Solve Program to find GCD or HCF of two numbers Solve LCM of two numbers Solve Check if a number is a strong number or not Solve Check if a given year is leap year Solve Reverse digits of a number Solve Program to add two fractions Solve Sum of digits of a number Solve Find all factors of a natural number Solve Prime factors of a given number Solve Kth largest factor of number N Solve Given number is even or odd Solve Perfect Number Solve Palindromes in a given range Solve Armstrong Numbers Solve Abundant Number Solve Sum of first n natural numbers Solve Sum of all natural numbers in range L to R Solve Primitive Abundant Number Solve Count ways to reach the n’th stair Solve Count prime numbers that can be expressed as sum of consecutive prime numbers Solve Fibonacci numbers Solve Check if a number is Palindrome Solve Largest and smallest digit of a number Solve Square Free Number Solve Permutations to arrange N persons around a circular table Solve Can a number be expressed as a sum of two prime numbers Solve Area of a circle Solve Roots of Quadratic equation Solve Conversions: We need to write a program to convert the given number(specific number system) into an equivalent number(specific number system). Problems Practice Convert Binary to Decimal Solve Convert binary to octal Solve Decimal to Binary conversion Solve Convert decimal to octal Solve Convert Octal to binary Solve Convert Octal to decimal Solve Convert a given number to words Solve Sorting Algorithm: Sorting Algorithm is used to rearrange a given array or list elements according to a comparison operator on the elements. Problems Practice Bubble Sort Solve Selection Sort Solve Insertion Sort Solve Quick Sort Solve Merge Sort Solve Radix Sort Solve Counting Sort Solve Comment More infoAdvertise with us Next Article Analysis of Algorithms K kartik Follow Improve Article Tags : DSA Software Development TCS Interview-Questions GFG Sheets SDE Sheet Company SDE Sheet +3 More Practice Tags : TCS Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. It’s the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like