TCS NQT 2026: Pattern, Syllabus, Cutoffs and Sample Paper

A single online test gates the Ninja (₹3.36 LPA), Digital (~₹7 LPA) and Prime (₹9–11.5 LPA) offers — same exam, different cutoffs. Crack TCS NQT and you've effectively cleared the door for India's largest IT recruiter. Here's exactly what's on the paper, what it takes to clear each tier, and a 4-week plan that has worked for our readers.

What you'll learn

• The exact section-wise pattern of TCS NQT 2026 — time, questions and marks per section.
• The syllabus for every section (and the sub-topics that actually get tested).
• Role-wise cutoffs for Ninja, Digital and Prime — and why "cleared NQT" doesn't always mean "got the offer".
• Sample questions in the format you'll see on exam day.
• A realistic 4-week preparation plan with daily topics, problems and mock checkpoints.
• The 5 mistakes that knock candidates out of the Digital/Prime tier even after clearing Ninja.

What is TCS NQT?

TCS National Qualifier Test (NQT) is an online, proctored aptitude + coding exam conducted by TCS iON. A single attempt makes you eligible for:

• TCS Ninja — base offer, ₹3.36 LPA, BE/BTech/MCA/MSc graduates.
• TCS Digital — premium offer, ~₹7 LPA, requires higher score + technical interview.
• TCS Prime — elite role, ₹9–11.5 LPA, top performers in coding + tech interview.
• TCS Smart Hiring — for BSc/BCA/BCom graduates.

The exam is the same paper for everyone. What changes is the cutoff threshold and the interview rounds you qualify for after the test.

TCS NQT 2026 — Exam pattern at a glance

A few rules every candidate should know:

1. Sections are timed individually. You cannot borrow time from one section to another. Once Numerical's 40 minutes are up, the system auto-locks it.
2. No negative marking in 2026 — but unanswered questions still cost you on cutoffs.
3. Coding language choice: C, C++, Java, Python, Perl. You can pick a different language for each of the two questions.
4. Section cutoffs apply — clearing the overall score isn't enough; you must hit a minimum in each section.
5. The exam is AI-proctored — webcam + screen-recording. No tabs, no copy-paste, no second person in frame.

Section-by-section syllabus

1. Numerical Ability (26 Qs / 40 min)

Core topics that actually appear:

• Time, Speed & Distance
• Time & Work, Pipes & Cisterns
• Percentages, Profit & Loss, SI/CI
• Ratio & Proportion, Mixtures & Alligation
• Number Systems, LCM/HCF, Divisibility
• Geometry & Mensuration (areas, volumes, triangle properties)
• Permutations, Combinations, Probability
• Data Interpretation (1 set of 3–4 linked questions)

Where TCS NQT gets you: questions look longer than they need to be. Read carefully — about 20% of questions can be solved by elimination faster than by calculation.

→ Brush up tricks first: Aptitude Shortcuts: Time, Work & Speed in 30 Seconds.

2. Verbal Ability (24 Qs / 25 min)

• Reading Comprehension (1 passage, ~4 questions)
• Para Jumbles
• Sentence Completion / Fill in the blanks
• Synonyms & Antonyms
• Error Spotting (subject-verb agreement, tense)
• Cloze tests

Pace matters more than vocabulary — ~63 seconds per question. Don't read the entire passage twice; skim for keywords and verify only the option you're picking.

3. Reasoning Ability (30 Qs / 50 min)

• Coding–Decoding
• Blood Relations
• Series (number, letter, alphanumeric)
• Direction Sense
• Statement & Conclusion
• Puzzles (linear, circular, scheduling)
• Visual Reasoning (figure series, image rotations)
• Data Sufficiency

Reasoning is the highest-scoring section for prepared candidates and the most time-eating for unprepared ones. Practice timed sets of 5 questions in 8 minutes to build pace.

4. Programming Logic — MCQ (10 Qs / 15 min)

• Time & space complexity (Big-O analysis)
• Data structures: arrays, linked lists, stacks, queues, trees, hashmaps
• Recursion outputs
• Pseudocode tracing
• OOPs concepts (encapsulation, inheritance, polymorphism, abstraction)
• DBMS basics — normalization, joins, ACID
• OS basics — process vs thread, scheduling, deadlock

These are conceptual, not language-specific. Read carefully — the answers often hinge on one keyword.

→ Companion reads: OOPs Concepts for Interviews — 12 Most-Asked Questions and DBMS Cheat Sheet.

5. Hands-on Coding (2 Qs / 45 min)

The single highest-leverage section for Digital and Prime aspirants. Two problems:

• Problem 1: typically string/array manipulation, math, or basic patterns. Easy on the LeetCode scale.
• Problem 2: typically two-pointer, sliding window, hashmap-based, or simple recursion. Easy-to-Medium on the LeetCode scale.

Sample skeleton question types we've seen:

• "Given an array of integers, find the second largest element without sorting the array."
• "Given a string s, return the longest substring with no repeating characters."
• "Print the first non-repeating character in a string."
• "Given a sentence, reverse the words but keep punctuation in place."

→ Drill these patterns first on practice problems tagged two-pointer and sliding-window.

TCS NQT cutoffs (role-wise)

Cutoffs are not officially published by TCS. The numbers below are reconstructed from candidate reports across the 2023–2025 cycles and are accurate enough to plan around:

Hitting the score isn't sufficient — you also need to clear sectional cutoffs. Candidates have failed Digital despite a 410 total because their Verbal was below the band.

Sample question — coding round

A real-flavour example to set expectations:

Problem 2 (sample): You are given a string s. Find the length of the longest substring that contains no more than two distinct characters.

Input: "eceba" → Output: 3 (the substring "ece")

Input: "ccaabbb" → Output: 5 (the substring "aabbb")

def longest_two_distinct(s):
    left = 0
    counts = {}
    best = 0
    for right, ch in enumerate(s):
        counts[ch] = counts.get(ch, 0) + 1
        while len(counts) > 2:
            counts[s[left]] -= 1
            if counts[s[left]] == 0:
                del counts[s[left]]
            left += 1
        best = max(best, right - left + 1)
    return best

This is a sliding-window pattern — exactly the kind we cover in Sliding Window Algorithm — When to Use It.

A realistic 4-week prep plan

This plan assumes 2 hours/day on weekdays + 4 hours on weekends — total ~80 hours over 4 weeks.

Week 1 — Foundations + Aptitude rebuild

• Days 1–2: Numerical core (percentages, ratios, profit/loss). 30 problems.
• Days 3–4: Time-speed-distance + time-work. 30 problems.
• Days 5–6: Permutations, combinations, probability. 20 problems.
• Day 7: Sectional mock — Numerical only. Aim 18/26 in 40 min.

Week 2 — Reasoning + Verbal

• Days 1–2: Coding-decoding, series, direction sense. 40 problems.
• Days 3–4: Puzzles (linear, circular). Timed 5-per-8-min sets.
• Day 5: Verbal — RC strategy + para jumbles. 30 problems.
• Day 6: Verbal — error spotting + cloze. 30 problems.
• Day 7: Sectional mock — Reasoning + Verbal. Aim 22/30 + 18/24.

Week 3 — Programming Logic + Coding patterns

• Days 1–2: OOPs + DBMS + OS conceptual MCQs. 50 questions.
• Days 3–4: Time complexity + recursion tracing. 30 problems.
• Days 5–7: Two-pointer + sliding window + hashmap problems — 15 total. Use PlacementRanker's pattern-tagged practice problems to drill these.

Week 4 — Full mocks + revision

• Days 1, 3, 5: Full-length TCS NQT mocks. Aim Day-1: 60%, Day-3: 70%, Day-5: 75%+.
• Days 2, 4: Review mock errors. Maintain a "mistake log".
• Day 6: Light revision, formulas + shortcut sheet only.
• Day 7: Rest. No new content the day before.

→ Practise on our TCS NQT mock test series — 10 tests built around the 2026 pattern.

Cutoffs alone don't get you the offer — 5 mistakes to avoid

1. Treating coding as "any-language". Choose Python for Problem 1 (fast to write) and stick with it. Switching mid-paper costs 5–10 minutes.
2. Skimming the Programming Logic section. Candidates rush through MCQs to "save time for coding" and drop 30+ marks. Each MCQ is worth 10.
3. Spending too long on one coding problem. If 20 minutes have passed and you haven't passed any test case, leave it — get the second problem to at least partial credit.
4. Ignoring section cutoffs. A 410 total with 14/30 in Reasoning is a Digital reject. Aim for >60% in every section.
5. No mock under exam conditions. Mocks taken at your own pace, without webcam stress, do not measure your real performance. Run at least 3 full mocks in proctored mode (or simulate it strictly).

Day-of-exam quick checklist

• Plain wall behind you. No people, no posters with faces.
• Water in a transparent bottle (allowed). Snacks not allowed.
• Logged in 15 minutes early. Latecomers are denied.
• One scribble pad + pen. Calculator on screen — don't bring your own.
• Use the restroom before the slot. No breaks during the exam.

Wrapping up

TCS NQT 2026 isn't harder than other entrance tests — it's just longer and stricter. Candidates clear it on pattern recognition, not raw IQ. Drill 6 numerical question types, 5 reasoning patterns, and 8 coding patterns, and the paper opens up.

Your next 3 moves:

1. Take the free TCS NQT diagnostic mock — 60 minutes, sectional. Find your weakest section.
2. Start the 4-week plan with Numerical (most students' weakest) or whichever section your diagnostic flagged.
3. Drill coding patterns on our pattern-tagged practice problems — focus on two-pointer, sliding window and hashmap first.

Good luck — and tell us when you clear Ninja, Digital or Prime. We feature interview experiences from readers on our case-study page.

Last updated: May 2026. The TCS NQT pattern has minor year-on-year variations. Always cross-check the latest from the official TCS NQT website (nextstep.tcs.com) the week before your exam.