Expected hiring
- Total Hires: 42,000+ freshers
- ASE: 36,000+ selections
- Digital Cadre: 6,000+ selections
- Locations: Pan-India
This page answers searches for TCS 2025 question paper and TCS NQT 2025 question paper: from student reports questions from the 2025 NQT cycle, the section-wise pattern, and step-by-step solutions. Use it to see what TCS asked in the latest hiring wave, how hard each section felt, and which aptitude/coding themes mattered most.
Practice under a 180-minute timer, then review answer keys below. For older years and bulk previous year papers with solutions PDF, visit TCS previous year question papers. Main guide: TCS placement papers.
| Section | Questions | Time | Difficulty | Focus Areas |
|---|---|---|---|---|
| Numerical Ability | 20-25 | 40 min | Medium | Quantitative aptitude, data interpretation |
| Verbal Ability | 20-25 | 30 min | Medium | English grammar, reading comprehension |
| Reasoning Ability | 20-25 | 40 min | Medium | Logical reasoning, puzzles |
| Programming Logic | 10-15 | 20 min | Medium | Basic coding MCQs |
| Coding | 1-2 | 50 min | Medium-Hard | Hands-on coding problems |
Total: 90-110 questions, 180 minutes Platform: TCS iON platform Languages Allowed: C, C++, Java, Python Success Rate: ~20-25% cleared NQT and advanced to interviews
This section contains practice questions styled on TCS placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.
Solution:
Old sum = 6 × 18 = 108. New sum = 108 − 12 + 24 = 120. New average = 120/6 = 20.
Answer: 20
Solution:
SI = (P × R × T)/100 = (5000 × 8 × 3)/100 = ₹1200.
Answer: ₹1200
Solution:
Combined rate = 1/10 + 1/15 = (10+15)/(10×15). Time = 10×15/(10+15) = 6 hours.
Answer: 6 hours
Solution:
Speed = distance/time = 240/16 m/s = (240/16) × (18/5) = 54 km/h.
Answer: 54 km/h
Solution:
Grandfather’s only son = Ravi’s father. Son of Ravi’s father = Ravi himself (or his brother).
In standard puzzle framing with one son implied for the speaker context: the person is Ravi’s brother (or Ravi). Most campus keys take Brother.
Answer: Brother
Solution:
Positions from left: A = 12, B = 40 − 10 + 1 = 31. Students between = 31 − 12 − 1 = 18.
Answer: 18
Solution:
‘Neither’ is singular → verb should be has, not have.
Correct: Neither of the boys has submitted his/their assignment.
Answer: have → has
Solution:
Use since with a point in time; use for with a duration.
Correct: since.
Answer: since
Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.
Example:
Input: nums = [2, 7, 11, 15], target = 9Output: [0, 1]Solution (Java):
public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { int need = target - nums[i]; if (map.containsKey(need)) return new int[]{map.get(need), i}; map.put(nums[i], i); } return new int[]{};}Time Complexity: O(n)
Space Complexity: O(n)
Problem Statement: Find the contiguous subarray with the largest sum.
Example:
Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]Output: 6 // [4, -1, 2, 1]Solution (Java):
public int maxSubArray(int[] nums) { int best = nums[0], cur = nums[0]; for (int i = 1; i < nums.length; i++) { cur = Math.max(nums[i], cur + nums[i]); best = Math.max(best, cur); } return best;}Time Complexity: O(n)
Space Complexity: O(1)
Problem Statement: Rotate the array to the right by k steps.
Example:
Input: [1,2,3,4,5,6,7], k = 3Output: [5,6,7,1,2,3,4]Solution (Java):
public void rotate(int[] nums, int k) { k %= nums.length; reverse(nums, 0, nums.length - 1); reverse(nums, 0, k - 1); reverse(nums, k, nums.length - 1);}void reverse(int[] a, int l, int r) { while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }}Time Complexity: O(n)
Space Complexity: O(1)
Expected hiring
Salary packages
Question trends
2024 papers
Aptitude questions
Coding questions
Interview experience
HR interview questions
Preparation guide
TCS hub