TCS NQT (National Qualifier Test) is conducted by Tata Consultancy Services and serves as a prerequisite for various recruitment assessments. The NQT score is valid for two years and allows candidates to apply for jobs through the TCS iON Job Listing Portal.
Conducted primarily online (remote proctored) or at TCS iON authorized centers (offline mode largely discontinued). This sheet is designed to help you prepare effectively for the TCS NQT exam and apply to top companies that recognize the NQT score. It includes commonly asked interview questions and answers to help you improve your chances of securing a job at TCS.
Take your TCS NQT 2026 preparation to the next level with GfG Connect - get 1:1 guidance from TCS professionals and industry experts. Gain real exam insights, personalized strategy, and practical tips from mentors, available online daily from 7 PM to 10 PM.
Topic-Wise DSA Questions
Arrays
Arrays are a collection of frequently asked interview questions on arrays in the TCS hiring test. Practice Problem
- Non-Repeating Element [Practice Problem]
- Program for Array Rotation [Practice Problem]
- Equilibrium Index of an Array [Practice Problem]
- Print array after it is right rotated K times [Practice Problem]
- Array is a subset of another array [Practice Problem]
- Reverse an array or string [Practice Problem]
- Mean and median of an unsorted array [Practice Problem]
- Smallest and second smallest elements in an array [Practice Problem]
- Largest Element in an Array [Practice Problem]
- Second Largest Element in an Array [Practice Problem]
- Counting frequencies of array elements [Practice Problem]
- Program for addition of two matrices [Practice Problem]
- Sum of elements in a given array [Practice Problem]
- Remove Duplicates from a Sorted Array [Practice Problem]
- Program to check if an array is sorted or not [Practice Problem]
- Remove duplicates from an unsorted array using Map data structure [Practice Problem]
- Average of an array (Iterative and Recursive) [Practice Problem]
- Find duplicates in O(n) time and O(1) extra space [Practice Problem]
- Find maximum possible stolen value from houses [Practice Problem]
- Replace Each Element of the Array with Its Corresponding Rank [Practice Problem]
- Sort elements by frequency [Practice Problem]
- Sort an array according to the order defined by another array [Practice Problem]
- Maximum Product Subarray [Practice Problem]
- Stock Buy and Sell – Max One Transaction Allowed [Practice Problem]
- Maximum Consecutive Ones (or Zeros) in a Binary Array [Practice Problem]
- Trapping Rain Water Problem [Practice Problem]
- Jump Game - Minimum Jumps to Reach End [Practice Problem]
String
String is the collection of the frequently asked interviews question on strings in the TCS hiring test.
- Check Whether a String Is a Palindrome [Practice Problem]
- Remove vowels from a String [Practice Problem]
- Remove spaces from a given string [Practice Problem]
- Remove character [Practice Problem]
- Remove all characters other than alphabets [Practice Problem]
- Reverse a string [Practice Problem]
- Sum of numbers in string [Practice Problem]
- Frequency of characters in a string [Practice Problem]
- Non-Repeating Character [Practice Problem]
- Smallest and Largest Words in a String [Practice Problem]
- Strings are anagram of each other [Practice Problem]
- Sort string of characters [Practice Problem]
- Convert characters of a string to opposite case [Practice Problem]
- Count words in a given string [Practice Problem]
- Encrypt the string [Practice Problem]
- Remove duplicates from a given string [Practice Problem]
- Check if a string is substring of another [Practice Problem]
- Reverse words in a given string [Practice Problem]
- Count Distinct Subsequences [Practice Problem]
- Common subsequence in two strings [Practice Problem]
- One string contains wildcard characters [Practice Problem]
- Longest Repeating Subsequence [Practice Problem]
- Check if one string is subsequence of other [Practice Problem]
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.
- Prime Numbers [Practice Problem]
- Sum of arithmetic series [Practice Problem]
- All divisors of a natural number [Practice Problem]
- Replace all ‘0’ with ‘5’ in an input Integer [Practice Problem]
- Number is Positive, Negative, Zero [Practice Problem]
- Program to find GCD or HCF of two numbers [Practice Problem]
- LCM of two numbers [Practice Problem]
- Check if a number is a strong number or not [Practice Problem ]
- Check if a given year is leap year [Practice Problem]
- Reverse digits of a number [Practice Problem]
- Program to add two fractions [Practice Problem]
- Sum of digits of a number [Practice Problem]
- Find all factors of a natural number [Practice Problem]
- Prime factors of a given number [Practice Problem]
- Given number is even or odd [Practice Problem]
- Perfect Number [Practice Problem]
- Armstrong Numbers [Practice Problem]
- Sum of first n natural numbers [Practice Problem]
- Count ways to reach the nth stair [Practice Problem]
- Fibonacci numbers [Practice Problem]
- Check if a number is Palindrome [Practice Problem]
- Can a number be expressed as a sum of two prime numbers [Practice Problem]
- Area of a circle [Practice Problem]
- Check if a number is a power of 2 [Practice Problem]
- Automorphic Number [Practice Problem]
Conversions
We need to write a program to convert the given number(specific number system) into an equivalent number(specific number system).
- Convert Binary to Decimal [Practice Problem]
- Decimal to Binary conversion [Practice Problem]
- Convert a given number to words [Practice Problem]
Sorting Algorithms
Sorting Algorithms is used to rearrange a given array or list elements according to a comparison operator on the elements.
- Bubble Sort [Practice Problem]
- Selection Sort [Practice Problem]
- Insertion Sort [Practice Problem]
- Quick Sort [Practice Problem]
- Merge Sort [Practice Problem]
- Radix Sort [Practice Problem]
- Counting Sort [Practice Problem]
- Find Kth smallest element using sorting / heap [Practice Problem]
- Search an element in a rotated sorted array [Practice Problem]
Verbal Ability
In Verbal Ability of 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
Take your TCS NQT 2026 preparation to the next level with GeeksforGeeks' TCS NQT 2026 Test Series + Recorded Content - a structured 4-week self-paced course packed with 80+ concept videos, 700+ practice MCQs, and 75+ coding problems.
Programming Logic
The TCS NQT Programming Logic exam tests your knowledge of C, C++, and Java, along with core computer science concepts such as OOPs and DSA. A strong understanding of data structures is essential. To prepare effectively, start by reviewing the fundamental concepts and guidelines.
- Data Structures: A Data Structures is a way to store and organize data efficiently for processing, retrieval, and storage, and it is a fundamental part of almost every software system.
- Algorithms: An Algorithms is a finite sequence of well-defined steps or rules used to solve a specific problem or perform calculations efficiently.
- OOPS Concepts: Object-Oriented Programming (OOPS ) is a programming approach that uses objects as the core building blocks to model real-world concepts such as inheritance, encapsulation, and polymorphism.
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 Prime : Highest-level profile through NQT, Requires excellent coding, problem-solving, and interview performance, Package: ₹9 – ₹12 LPA (varies by location, degree, and performance)
- 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. Package: ₹7.0 – ₹7.9 LPA
- 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.