Thoughtworks 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Thoughtworks 2026 Pattern Details
Overview
This page collects Thoughtworks placement papers from 2026 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.
Download / jump links
Thoughtworks 2026 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
Thoughtworks Aptitude Mock Quiz
Timed placement-style MCQs with score and explanations after you submit. Use it to check speed and accuracy before the real test.
Questions15
Time10 min
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%)
Review
Thoughtworks exam pattern 2026
| 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
Sample Thoughtworks questions with solutions
These are practice-style questions aligned to patterns students report for Thoughtworks drives around 2026. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2026)
Q1: Three workers
Problem: A finishes work in 12 days, B in 15 days, and C in 20 days. Working together, how many days do they need?
Solution: Take total work = LCM(12,15,20) = 60 units. A = 5/day, B = 4/day, C = 3/day. Combined = 12 units/day. Time = 60/12 = 5 days.
Answer: 5 days
Q2: Age ratio
Problem: The ratio of ages of A and B is 3:5. After 8 years the ratio becomes 5:7. Find A’s present age.
Solution: Let ages be 3x and 5x. (3x+8)/(5x+8) = 5/7 7(3x+8) = 5(5x+8) 21x + 56 = 25x + 40 4x = 16 → x = 4 A’s age = 12 years.
Answer: 12 years
Q3: Pipe fill
Problem: Pipe A fills a tank in 6 hours and pipe B in 8 hours. How long do they take together to fill it?
Solution: Combined rate = 1/6 + 1/8 = 4/24 + 3/24 = 7/24. Time = 24/7 hours ≈ 3 hours 26 minutes.
Answer: 24/7 hours
Q4: Simple interest
Problem: Find the simple interest on ₹8000 at 10% per annum for 2 years.
Solution: SI = (P × R × T) / 100 = (8000 × 10 × 2) / 100 = ₹1600.
Answer: ₹1600
Q5: Percentage recover
Problem: If 30% of a number is 150, what is the number?
Solution: 0.3x = 150 → x = 150 / 0.3 = 500.
Answer: 500
Q6: Average after replace
Problem: The average of five numbers is 20. One number 30 is replaced by 10. What is the new average?
Solution: Old sum = 5 × 20 = 100. New sum = 100 − 30 + 10 = 80. New average = 80 / 5 = 16.
Answer: 16
Q7: Series n(n+1)
Problem: Find the next term: 2, 6, 12, 20, 30, ?
Solution: Pattern: 1×2, 2×3, 3×4, 4×5, 5×6, 6×7. Next = 6 × 7 = 42.
Answer: 42
Q8: Deck probability
Problem: What is the probability of drawing an ace from a standard 52-card deck?
Solution: There are 4 aces in 52 cards. Probability = 4/52 = 1/13.
Answer: 1/13
Logical reasoning (2026)
Q1: Analogy
Problem: Book is to Reading as Fork is to ?
Solution: A book is used for reading; a fork is used for eating.
Answer: Eating
Q2: Odd one out
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
Q3: Coding letter shift
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
Q4: Blood relation
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
Coding practice (2026)
Coding Q1: Two Sum
Problem: Given an array of integers and a target, return indices of two numbers that add up to the target. Assume exactly one solution and you may not use the same element twice.
Approach: Walk the array once. For each value x, check whether target − x was seen earlier in a hash map of value → index. If yes, return both indices; else store x.
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.
Coding Q2: Longest substring without repeating characters
Problem: Given a string s, find the length of the longest substring without repeating characters. Example: ‘abcabcbb’ → 3 (‘abc’).
Approach: Sliding window with a map (or last-seen index) of characters. Expand the right pointer; when a duplicate appears inside the window, move the left pointer past the previous occurrence.
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.
Coding Q3: Merge overlapping intervals
Problem: Given a list of intervals [start, end], merge all overlapping intervals and return the non-overlapping set that covers the same ranges.
Approach: Sort by start time. Walk once, merging into the last interval in the result when the next start is ≤ current end; otherwise append a new interval.
Complexity: O(n log n) time from the sort
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.
Coding Q4: Top K frequent elements
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.
Coding Q5: Linked list cycle
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.
Coding Q6: Binary tree level order
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.
Coding Q7: Coin change (min coins)
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.
Coding Q8: Binary search
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.
Deep prep notes for Thoughtworks
How the Thoughtworks coding / pair interview usually feels
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.
Topic weight hints
| 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 |
14-Day sprint
- Days 1-3: Learn the 2026 pattern and take two sectional mocks
- Days 4-7: Closed practice on weak topics from your error log
- Days 8-10: Full mocks every other day; review the same day
- Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready
Comments & Suggestions
Related
Similar companies
EPAM · Nagarro · Publicis Sapient · Globant · Zoho