www.newleafins.

com

TCS NQT 2025 | 25th March | Exam Shift 1 & 2 Analysis

TCS Pattern:
Section Total Time Total Questions
Part A: Foundation Section
Numerical Ability 25 mins 20 Q
Verbal Ability 25 mins 25 Q

Reasoning Ability 25 mins 20 Q

Part B: Advanced Section

Advanced Quantitative + Reasoning Ability 25 mins 15 Q

Advanced Coding 90 mins 2Q

Total Duration 190 mins

Disclaimer:
1. The questions in this document have been reconstructed from memory by test takers who
recalled them after their exam.
2. There is minimal repetition of questions between different slots.
3. Use this document as a reference for preparation rather than a replica of the questions that
have appeared or may appear in the TCS NQT.

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com

APTITUDE & REASONING QUESTIONS

Date: 25/03/2025 (Afternoon)

1. 2 men can do a work in 14 days. Then find how many men are required to finish the work
in 4 days?
Answer: 7 men

2. Find the minimum value of f(x) = 3 + |2x + 11|

a)4 b)3 c)2 d)0
Answer: 3

3. series based problem 3, 8, 15, 24, 35,?

Answer: 48

4. A man sold a toy for Rs.10620 but incurred a loss of 10%, if he wants to gain a profit of
12% then how much he has to sell?
Answer: 13216

5. A man age present age is two and half times of sum of ages of his two daughters. 30 years
later his age will the sum of ages of his two daughters. Then what will be man ages in 12
years from now?
Answer: 62

6. A income is 18200. He spent his 89% as expenditure. Calculate his saving.?

Answer: 2002

7. find the largest value that divide 639 and 1468 that leaves remainder 4 and 3 is:
a) 25 b) 5 c) 45 d) 15
Answer: 5

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
8. A train moves from A to B and returns from B to A but the speed from A to B was 50km/hr
and the speed from B to A is 60km/hr. what is the average speed of the train?
Answer: 54.54Kmph

9. One interesting questions was if L, N, M are mode, median and mean then which of the
following is correct?
Answer: L = 3N-2M

10. In a class average marks of 12 students is 36. If the marks of each student become
double, what will be the average?
Answer: 72

11. A rectangle have area of 154 cm^2. Its length is 4 times + 4 cm of breath. What would be
the quadratic equation of this?
Answer:
lb=154, l=4b+4
(4b+4)b = 154
4b2+4b−154=0
2b2+2b−77=0

12. A is father of S, D is daughter of F, B is brother of D, S is husband of F. How A related to

B?
Answer: Grand Father

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
CODE QUESTIONS
Shift - 1

Question-1
First Non-Repeating and Most Frequent Character

Given a string S, perform the following tasks:

1. Find the first non-repeating character in the string. If no non-repeating character exists,
return "None".

2. Find the most frequent character in the string. If all characters are unique, return the first
character.

You must consider case-sensitive characters (i.e., 'a' and 'A' are different).

Input Format:

• A single line containing the string S.

• The string consists of lowercase and uppercase English letters (a-z, A-Z).

Output Format:

Print two space-separated values:

• The first non-repeating character or "None" if none exists.

• The most frequent character in the string.

Input: swadesh
Output: w s

Java Code:
import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {

public static String findCharacters(String s) {
Map<Character, Integer> freqMap = new HashMap<>();
Map<Character, Integer> indexMap = new LinkedHashMap<>();

for (int i = 0; i < s.length(); i++) {

char c = s.charAt(i);

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
freqMap.put(c, freqMap.getOrDefault(c, 0) + 1);
if (!indexMap.containsKey(c)) {
indexMap.put(c, i);
}
}

String firstNonRepeating = "None";

for (Map.Entry<Character, Integer> entry : indexMap.entrySet()) {
if (freqMap.get(entry.getKey()) == 1) {
firstNonRepeating = String.valueOf(entry.getKey());
break;
}
}
char mostFrequent = s.charAt(0);
int maxFreq = 0;
for (Map.Entry<Character, Integer> entry : freqMap.entrySet()) {
if (entry.getValue() > maxFreq) {
maxFreq = entry.getValue();
mostFrequent = entry.getKey();
}
}

return firstNonRepeating + " " + mostFrequent;

}

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

String s = scanner.next();

System.out.println(findCharacters(s));

scanner.close();
}
}

Shift - 1

Question-2

Income and Expense Tracker

Write a program that takes a user's total income (in dollars $) and a series of expenses. The
program should then calculate:

• Total income

• Total expenses

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com

• Total savings (Income - Expenses)

• Breakdown of expenses by category

The user should enter "done" to indicate that they have finished entering expenses.

Input Format:

1. An integer representing the total income (in dollars).

2. A series of expense entries, where each consists of:

• A string (expense category).

• An integer (amount spent on that category).

3. The input "done" indicates the end of expense entries.

Output Format:

1. Summary of expenses, including:

• Total income ($)

• Total expenses ($)

• Total savings ($)

2. Expense breakdown with each category and the amount spent ($).

Constraints:

• 1 ≤ income ≤ 10^6

• 1 ≤ expense amount ≤ income

• The expense type will be a single word (no spaces).

• The user must type "done" to stop entering expenses.

Input:
1000
food
200
transport
150
done

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
Output:
Summary of expenses:
Total income: 1000$
Total expenses: 350$
Total savings: 650$
Analysis:
Expense and price:
food: 200$
transport: 150$

Java Code:
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int income = scanner.nextInt();
Map<String, Integer> expenses = new LinkedHashMap<>();
int totalExpenses = 0;
while (true) {
String expenseType = scanner.next();
if (expenseType.equalsIgnoreCase("done")) {
break;
}
int price = scanner.nextInt();
expenses.put(expenseType, expenses.getOrDefault(expenseType, 0) + price);
totalExpenses += price;
}
int totalSavings = income - totalExpenses;
System.out.println("Summary of expenses:");
System.out.println("Total income: " + income + "$");
System.out.println("Total expenses: " + totalExpenses + "$");
System.out.println("Total savings: " + totalSavings + "$");
System.out.println("Analysis:");
System.out.println("Expense and price:");
for (Map.Entry<String, Integer> entry : expenses.entrySet()) {
System.out.println(entry.getKey() + ": " + entry.getValue() + "$");
}
scanner.close();
}
}

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
Shift - 2

Question-1

You are given an array of numbers and two integers, X and Y, which define a range. Your
task is to count the number of valid pairs (i, j) where:
 The numbers at index i and j (which can be the same) are concatenated as strings.
 The resulting concatenated number should lie within the range [X, Y] (inclusive).
 You must count all valid pairs, including duplicate values (not just unique pairs).

Input Format:
1. The first line contains two space-separated integers: X and Y.
2. The second line contains space-separated integers representing the array.

Output Format:
 Print a single integer representing the count of valid concatenated pairs.

Input:
10 500
12345

Step-by-Step Explanation:
Given X = 10 and Y = 500, we take the array:
[1, 2, 3, 4, 5]
We generate all concatenated numbers:
Since all concatenated values fall within [10, 500], we count 25 valid pairs.

Correct Output:
25

Java Code:
import java.util.*;
public class Main {
public static int countValidPairs(int[] arr, int X, int Y) {
int count = 0;
for (int i : arr) {
for (int j : arr) {

Gmail: [email protected] Contact: +91 99428 90761

 www.newleafins.com
int concatenatedNum = Integer.parseInt(i + "" + j);
if (X <= concatenatedNum && concatenatedNum <= Y) {
count++;
}
}
}
return count;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int X = scanner.nextInt();
int Y = scanner.nextInt();
scanner.nextLine();
String[] inputArr = scanner.nextLine().split(" ");
int[] arr = new int[inputArr.length];
for (int i = 0; i < inputArr.length; i++) {
arr[i] = Integer.parseInt(inputArr[i]);
}
System.out.println(countValidPairs(arr, X, Y));
scanner.close();
}
}

Gmail: [email protected] Contact: +91 99428 90761

 TCS NQT | 2025 BATCH
25/03/2025 | FORENOON
We're proud to have covered 70% of the topics exactly as taught in our TCS classes, closely aligning with the actual
exam pattern for effective preparation!

S.No CONTENT No Of Questions

QUANTITATIVE
1 Percentage, Profit & Loss 01
2 Dice 01
3 Ratio and Proportion, Ages 02
4 Coded Words 03
5 Function & Polynomials 02
6 Data Interpretation 02
7 Simple & Compound Interest 03
8 Mensuration [Circle, Sphere, Hemisphere] 02
9 Simplification 02
10 Statistics [Mean, Median, Mode] 02
11 Bar Graph 02
12 Time and Work, Chain Rule 01
13 Speed and Distance 01
14 Number System 01
REASONING
1 Coding Inequality 04
2 Blood Relation 03
3 Non-Verbal Reasoning (Paper Cutting & Folding, Figure and Factual) 02
4 Coding and Decoding 03
5 Eligibility Test 05
6 Data Sufficiency 01
7 Critical Reasoning 03
8 Seating Arrangement 05
9 Syllogism 02
10 Number Series and Letter Series, Odd Man Out 03
11 Venn Diagram 01
VERBAL
1 Reading Comprehension - 03 Passages (03 or 02 questions in each passage) -
2 Cloze Test 04
3 Error Spotting 03
4 Fill in the Blank Space [Phrases & Idioms Type] 03
5 Para Jumble 05
6 Re arrangement of sentence 02
CODING
Arrays Based Questions

www.newleafins.com [email protected] +91-99428 90761

 TCS NQT | 2025 BATCH
25/03/2025 | AFTERNOON
We're proud to have covered 70% of the topics exactly as taught in our TCS classes, closely aligning with the actual
exam pattern for effective preparation!

S.No CONTENT No Of Questions

QUANTITATIVE
1 Ratio and Proportion, Ages 01
2 Bar Graph 01
3 Percentage, Profit & Loss 02
4 Number System 03
5 Function & Polynomials 02
6 Data Interpretation 02
7 Simple & Compound Interest 03
8 Mensuration [Circle, Sphere, Hemisphere] 02
9 Time and Work, Chain Rule 02
10 Statistics [Mean, Median, Mode] 02
11 Dice 02
12 Simplification 01
13 Speed and Distance 01
14 Coded words 01
REASONING
1 Non-Verbal Reasoning (Paper Cutting & Folding, Figure and Factual) 04
2 Syllogism 03
3 Coding Inequality 02
4 Venn Diagram 03
5 Critical Reasoning 05
6 Data Sufficiency 01
7 Eligibility Test 03
8 Seating Arrangement 05
9 Blood Relation 02
10 Number Series and Letter Series, Odd Man Out 03
11 Coding and Decoding 01
VERBAL
1 Reading Comprehension - 03 Passages (03 or 02 questions in each passage) -
2 Cloze Test 04
3 Para Jumble 03
4 Fill in the Blank Space [Phrases & Idioms Type] 03
5 Error Spotting 05
6 Re arrangement of sentence 02
CODING
Arrays Based Questions

www.newleafins.com [email protected] +91-99428 90761