If you’re preparing for the TCS NQT Exam 2024-2025, you’ve probably heard about the importance of the coding section. It’s one of the most challenging yet scoring parts of the exam. In this blog, I’m going to share insights about TCS coding questions and introduce the top 50 coding questions that have been asked in previous NQT exams.
Why Focus on the Coding Section?
The coding section tests your problem-solving skills, logical thinking, and knowledge of programming languages like C, C++, Java, or Python. Solving these questions not only boosts your confidence but also improves your chances of clearing the exam with a good score.
Exam Pattern For TCS NQT :
| Section | Duration (in Minutes) |
|---|---|
| PART-A (Foundation Section) | |
| Numerical Ability | 25 |
| Verbal Ability | 25 |
| Reasoning Ability | 25 |
| PART-B (Advanced Section) | |
| Advanced Quantitative & Reasoning Ability | 25 |
| Advanced Coding | 90 |
| Total Duration | 190 |
Here the TCS package/CTC details typically associated with various roles:
| Role | CTC (in LPA) | Description |
|---|---|---|
| TCS Ninja | 3.5 – 3.6 LPA | Entry-level package for freshers as Assistant Systems Engineer. |
| TCS Digital | 7 – 7.5 LPA | Advanced package for exceptional candidates with superior skills. |
| TCS Innovator | ~9 LPA or higher | Specialized R&D roles, often offered to top-tier talent. |
Practice Sheet :
Here’s a curated list of 50 important TCS NQT coding questions that frequently appear in placement exams. These cover a range of difficulty levels, including basic, intermediate, and advanced concepts:
Basic Level:
- Reverse a number.
- Check if a number is prime.
- Calculate the factorial of a number.
- Check for palindrome in a string.
- Print the Fibonacci series up to n terms.
- Find the greatest common divisor (GCD) of two numbers.
- Check if a number is an Armstrong number.
- Determine if a string is an anagram of another.
- Swap two numbers without using a third variable.
- Print patterns such as stars or numbers.
Intermediate Level:
- Implement bubble sort.
- Merge two sorted arrays.
- Find the second largest number in an array.
- Detect a loop in a linked list.
- Calculate the sum of digits of a number.
- Validate balanced parentheses in an expression.
- Convert infix expressions to postfix.
- Find the first non-repeating character in a string.
- Find the missing number in an array of 1 to n.
- Perform matrix multiplication.
Advanced Level:
- Implement a binary search algorithm.
- Solve the knapsack problem using dynamic programming.
- Find the longest increasing subsequence.
- Implement a minimum spanning tree algorithm (e.g., Kruskal’s or Prim’s).
- Perform a depth-first search (DFS) and breadth-first search (BFS) in a graph.
- Find the shortest path using Dijkstra’s algorithm.
- Solve the N-Queens problem.
- Check for a subset with a given sum.
- Perform string matching using KMP algorithm.
- Solve the Tower of Hanoi problem.
Miscellaneous:
- Count the frequency of characters in a string.
- Rotate an array by k elements.
- Implement a queue using two stacks.
- Reverse words in a given string.
- Solve the coin change problem.
- Find duplicates in an array.
- Count the number of islands in a grid.
- Convert a binary tree to a doubly linked list.
- Merge two binary trees.
- Detect a cycle in a directed graph.
Real-World Problems:
- Write code for an LRU cache.
- Implement a booking system using a queue.
- Build a simple calculator using stacks.
- Find the median of a data stream.
- Optimize a solution for maximum profit in stock buying and selling.
- Simulate a parking lot management system.
- Create a solution for page ranking using graphs.
- Write a file system checker tool.
- Implement predictive text functionality.
- Build a small chat application logic.