TCS NQT All India 2026 Hiring Test Experience
Bolloju Sai Vinay
348

TCS NQT All India 2026 Hiring Test Experience

I recently appeared for the TCS NQT All India 2026 Hiring Test

The exam was conducted at TCS iON centers and lasted for 3 hours, divided into 5 sections. You can navigate between questions within a section, but once the section time ends, you cannot go back, so make sure you keep an eye on the clock. The Quantitative Aptitude section (20 questions, 25 minutes) was very time-consuming—even the initial questions took time, and I could attempt only a few, so the goal should be to clear the cutoff rather than attempting all questions. The Verbal section (20 questions, 20 minutes) was manageable, but RCs (Reading Comprehension) can take time if not handled properly. The Reasoning section (~20 questions, ~25 minutes) was moderate overall. There was also an Advanced Quant section (10 questions, 20 minutes), which felt slightly easier than the foundational quant and required good practice to manage within time.

The coding section had strict timing: 35 minutes for the first question and 55 minutes for the second question. The first question was very easy and purely simulation-based just carefully implement what is asked. The second question was medium level and required a bit more thinking. Overall, the exam is not very difficult in terms of concepts, but time pressure, environment, and sectional cutoffs make it challenging. Focus on accuracy, don’t panic, and even solving one coding question completely can get you an interview call with cutoff marks in Aptitude.

💻 Coding Questions

Question 1 (Easy – Simulation)

A story-based question (something around ticket pricing), but the core task was:

  • Given an array of numbers

  • Identify all odd numbers

  • Print:

    • Count of odd numbers
    • Sum of odd numbers
    • Average (up to 2 decimal places)

👉 I solved 5/7 test cases, probably missed some edge cases.

Sample Testcases:

Input:

7
1 2 3 4 5 6 7

Output:

Count: 4
Sum: 16
Average: 4.00

Question 2 (Medium – Closest Cost Combination)

  • Two arrays:

    • breads[] → base costs
    • toppings[] → additional costs

  • Given a target value - t

  • Conditions:

    • Must choose exactly 1 bread
    • Each topping can be chosen at most 2 times

  • Goal:

    • Find total cost closest to target

👉 I solved 5/7 test cases, approach may not be efficient.

Sample Testcases:

Input:

breads = [3, 10]
toppings = [2, 5]
target = 9

Output:

9

Tip:

This was my second attempt; my first was the TCS TAG exam after CodeVita, where the compiler experience was honestly very bad. This time I was already familiar with the environment, which helped me stay calmer.
Quick tip: Practice writing full code in VS Code with different input styles (especially inputs without size for arrays), because TCS does not provide any templates and input handling itself can consume time. Please make sure you use the fullscreen mode while writing the code, else you will have the worst UI Experience. Ctrl+C and Ctrl+V won't work even within the coding interface, the code will be lost when you try!!

Interview Experience :

https://leetcode.com/discuss/post/8327102/tcs-nqt-all-india-hiring-2026-interview-76d5r/

Verdict : Selected
Role : Digital

Comments (1)