Thoughtworks 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects Thoughtworks placement papers from 2025 with practice questions, worked solutions, and the exam pattern students reported that cycle. Use it when you want drive history: what the first round looked like, which topics repeated, and how to approach solutions. Work the sets below under a timer, then compare with newer material so your prep matches both established Thoughtworks patterns and recent shifts.
Thoughtworks 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Thoughtworks 2025 coding
DSA practice aligned to Thoughtworks online assessments
Thoughtworks interview experience
Round structure and tips from student reports
Thoughtworks prep guide
Study plan and weekly schedule
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Reasoning
A walks 9 km north, then 12 km east. Distance from start is:
Right triangle → 15 km.
Quantitative
A 120 m train crosses a pole in 8 s. Speed in km/h is:
Speed = 120/8 = 15 m/s = 54 km/h.
Quantitative
What is the output for n=7?
Correct answer: TRUE
Verbal
"The committee have decided": correct form is:
Collective noun "committee" as one unit takes singular "has".
Quantitative
A man buys an article for ₹800 and sells it at 25% profit. Selling price is:
SP = 800 × 1.25 = ₹1,000.
Verbal
A person who writes dictionaries is a:
Correct term: Lexicographer.
Quantitative
A sum of ₹8,000 amounts to ₹9,600 in 4 years at simple interest. Find the rate of interest per annum.
Principal = ₹8,000, Amount = ₹9,600 Interest = 9,600 - 8,000 = ₹1,600 SI = P × R × T / 100 1,600 = 8,000 × R × 4 / 100 R = (1,600 × 100) / (8,000 × 4) = 5%
Reasoning
Find next number: 2, 3, 5, 7, 11, ?
Pattern: Prime numbers in sequence 2, 3, 5, 7, 11, 13... Next: 13
Verbal
One who loves books is a:
Bibliophile = lover of books.
Reasoning
Odd one out: 8, 27, 64, 100, 125
Others are perfect cubes; 100 is not.
Reasoning
Find the missing number: 8, 12, 18, 26, 36, ?
Correct answer: 48
Verbal
Three pipes A, B, C can fill a tank in 12, 15, and 20 hours respectively. If all three are opened together, how long will it take to fill the tank?
A's rate = 1/12 per hour B's rate = 1/15 per hour C's rate = 1/20 per hour Combined rate = 1/12 + 1/15 + 1/20 = (5+4+3)/60 = 12/60 = 1/5 per hour Time = 1 / (1/5) = 5 hours
Reasoning
If letter positions are summed (A=1…Z=26), PEN equals:
Sum of positions = 35.
Quantitative
Two numbers are in ratio 3:5 and their sum is 56. The larger number is:
Parts = 8. Larger = 5/8 × 56 = 35.
Quantitative
The following table shows the sales of a company over 5 years. If the total sales in 2020 was ₹50,000, and sales increased by 20% each year, find the sales in 2024.
Sales in 2020 = ₹50,000 Sales in 2021 = 50,000 × 1.2 = ₹60,000 Sales in 2022 = 60,000 × 1.2 = ₹72,000 Sales in 2023 = 72,000 × 1.2 = ₹86,400 Sales in 2024 = 86,400 × 1.2 = ₹103,680
Your score
0/15(0%)
| Section | What shows up | Prep focus |
|---|---|---|
| Aptitude / logical | Quant, reasoning, sometimes verbal | Timed sectional accuracy |
| Coding / programming logic | Easy-medium DSA or output-style MCQs | Handle tricky inputs |
| Technical interview | OOPs, DBMS, OS, projects | Explain aloud |
| HR | Fit, location, intent | A few real examples ready |
First round: Thoughtworks Coding / Pair Interview
Skills emphasized: DSA, clean code, TDD/agile thinking
Languages: Java, Kotlin, Python, Ruby, JavaScript
These are practice-style questions aligned to patterns students report for Thoughtworks drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Problem: If the price of an item rises by 25%, by what percent should consumption fall so that expenditure stays the same?
Solution: Required reduction = r/(100+r) × 100 with r = 25. = 25/125 × 100 = 20%.
Answer: 20%
Problem: An article is marked 40% above cost and sold after a 10% discount. Find the profit percent.
Solution: SP = CP × 1.4 × 0.9 = 1.26 CP. Profit = 26%.
Answer: 26%
Problem: An article sold at 10% loss would give 5% profit if sold for ₹60 more. Find the cost price.
Solution: 0.9P + 60 = 1.05P 60 = 0.15P P = 60 / 0.15 = ₹400.
Answer: ₹400
Problem: Eight workers finish a job in 10 days. How many days will 10 workers take for the same job (same pace)?
Solution: Total man-days = 8 × 10 = 80. Days for 10 workers = 80 / 10 = 8 days.
Answer: 8 days
Problem: A vehicle travels at 60 km/h for 2.5 hours. How far does it go?
Solution: Distance = speed × time = 60 × 2.5 = 150 km.
Answer: 150 km
Problem: If two ratios are 3:5 and 5:7, what is the compound ratio?
Solution: Compound ratio = (3/5) × (5/7) = 3/7, written as 3:7.
Answer: 3:7
Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.
Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.
Answer: ₹1200
Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?
Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.
Answer: 3 hours
Problem: Book is to Reading as Fork is to ?
Solution: A book is used for reading; a fork is used for eating.
Answer: Eating
Problem: Find the odd one out: 3, 5, 7, 9, 11
Solution: 3, 5, 7, and 11 are prime. 9 = 3×3 is composite, so it is the odd one out.
Answer: 9
Problem: If CAT is coded as DBU, how is DOG coded in the same way?
Solution: Each letter moves +1 in the alphabet: C→D, A→B, T→U. D→E, O→P, G→H → EPH.
Answer: EPH
Problem: Pointing to a photograph, Ravi says, ‘She is the daughter of my mother’s only son.’ How is the girl related to Ravi?
Solution: Ravi’s mother’s only son is Ravi himself (assuming one son). The girl is therefore Ravi’s daughter.
Answer: Daughter
Problem: Given an integer array and an integer k, return the k most frequent elements. Order among equals can be arbitrary unless the problem says otherwise.
Approach: Count frequencies with a hash map, then use a heap of size k (or bucket sort by frequency) to extract the top k keys.
Complexity: O(n log k) with a heap
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Given the head of a linked list, return true if there is a cycle and false otherwise.
Approach: Floyd’s tortoise and hare: move one pointer one step and another two steps. If they meet, a cycle exists. If the fast pointer hits null, there is no cycle.
Complexity: O(n) time, O(1) space
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Given the root of a binary tree, return the level-order traversal (breadth-first) as a list of levels.
Approach: Use a queue. For each level, drain the current queue size, collect values, and enqueue children for the next level.
Complexity: O(n) time, O(n) space
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Given coin denominations and an amount, return the fewest coins needed to make that amount, or -1 if it is impossible.
Approach: Unbounded knapsack DP: let dp[x] be the minimum coins for amount x. For each coin, update dp[c..amount]. Initialize dp[0] = 0 and the rest to a large sentinel.
Complexity: O(amount × coins)
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Given a sorted array of distinct integers and a target, return the index of target or -1 if missing.
Approach: Maintain lo/hi. Compare mid with target and shrink the half that cannot contain it. Careful with overflow-free mid and empty arrays.
Complexity: O(log n) time
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Move all zeros in an array to the end while keeping the relative order of non-zero elements.
Approach: Two pointers: write non-zeros toward the front, then fill the remainder with zeros. Or swap zeros as you scan.
Complexity: O(n) time, O(1) space
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Rotate an array to the right by k steps. Example: [1,2,3,4,5,6,7], k = 3 → [5,6,7,1,2,3,4].
Approach: Normalize k %= n. Reverse the whole array, reverse the first k elements, then reverse the rest. That yields the rotation in place.
Complexity: O(n) time, O(1) space
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Problem: Find the first non-repeating character in a string and return its index, or -1 if none exists.
Approach: Count frequencies in one pass (hash map or array of 26 for lowercase). Second pass returns the first index with count 1.
Complexity: O(n) time
Thoughtworks tip: Restate the problem, sketch a brute-force idea, then tighten it. Call out edge cases (empty input, single element, overflow) before you write code.
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Thoughtworks, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Kotlin, Python, Ruby, JavaScript.
| Area | Why it matters at Thoughtworks |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Software Consulting, Agile awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |
EPAM · Nagarro · Publicis Sapient · Globant · Zoho