Tiger Analytics 2026 aptitude
Quantitative, reasoning, and verbal drills with solutions
Tiger Analytics 2026 Pattern Details
Overview
This page collects Tiger Analytics 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 Tiger Analytics patterns and recent shifts.
Download / jump links
Tiger Analytics 2026 coding
DSA practice aligned to Tiger Analytics online assessments
Tiger Analytics interview experience
Round structure and tips from student reports
Tiger Analytics prep guide
Study plan and weekly schedule
Tiger Analytics 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
Quantitative
A man can row 7 km/h in still water. If the river is flowing at 3 km/h, how long will it take him to row 12 km downstream?
Speed in still water = 7 km/h Speed of stream = 3 km/h Downstream speed = 7 + 3 = 10 km/h Time = Distance/Speed = 12/10 = 1.2 hours = 1 hour 12 minutes
Verbal
Choose the correctly used word: "The manager _____ the importance of teamwork."
"Emphasize" is a transitive verb and doesn't require a preposition.
Quantitative
If "PENCIL" is coded as "RGPENK", how is "PAPER" coded?
Correct answer: RCRGT
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%
Quantitative
A game: Win $100 with 30% probability, lose $50 with 70% probability. Expected value?
Correct answer: 0.3 × 100 + 0.7 × (-50) = 30 - 35 = -$5
Reasoning
If letter positions are summed (A=1…Z=26), TEAM equals:
Sum of positions = 39.
Verbal
Fill in: The news _____ shocking.
News is singular → is.
Reasoning
Find the next number: 3, 9, 27, 81, ?
×3 each → 243.
Reasoning
If RED is 27 and BLUE is 40 (sum of positions), GREEN is:
G+R+E+E+N = 7+18+5+5+14 = 49.
Quantitative
Price rises 25%. By what % should consumption fall to keep expenditure same?
Reduction = r/(100+r)×100 = 25/125×100 = 20%.
Verbal
Problem: Find the antonym of "BRILLIANT": a) Bright b) Dull c) Shining d) Smart
Brilliant means very bright or intelligent, so "Dull" is the antonym.
Verbal
The company's profits have been _____ steadily over the past year.
Correct answer: declining
Reasoning
Complete the series: AZ, BY, CX, ?
First letter +1, second −1 → DW.
Reasoning
Two trains of lengths 100m and 150m are running in the same direction at speeds of 50 km/hr and 40 km/hr respectively. Find the time taken by faster train to overtake the slower train.
Relative speed = 50 - 40 = 10 km/hr = 10 × 5/18 = 25/9 m/s Distance to cover = 100 + 150 = 250m Time = 250 / (25/9) = 250 × 9/25 = 90 seconds
Quantitative
A shopkeeper sells an item at 20% profit. If he had bought it at 10% less and sold it for ₹40 less, he would have gained 25%. Find the cost price.
Correct answer: ₹800
Your score
0/15(0%)
Review
Tiger Analytics 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: Tiger Analytics Assessment
Skills emphasized: SQL, Python, case, aptitude
Languages: Python, SQL
Sample Tiger Analytics questions with solutions
These are practice-style questions aligned to patterns students report for Tiger Analytics 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: Train and pole
Problem: A train 150 meters long passes a pole in 15 seconds. What is its speed in km/h?
Solution: Distance = 150 m = 0.15 km. Time = 15 s = 15/3600 h = 1/240 h. Speed = 0.15 ÷ (1/240) = 0.15 × 240 = 36 km/h.
Faster check: 150/15 = 10 m/s → 10 × 18/5 = 36 km/h.
Answer: 36 km/h
Q2: Profit on a pen
Problem: If the cost price of a pen is ₹40 and it is sold at a 25% profit, what is the selling price?
Solution: Profit = 25% of 40 = ₹10. Selling price = 40 + 10 = ₹50.
Or SP = CP × 1.25 = 40 × 1.25 = ₹50.
Answer: ₹50
Q3: A and B together
Problem: A can finish a job in 10 days and B in 20 days. How long will they take working together?
Solution: A’s one-day work = 1/10. B’s one-day work = 1/20. Together = 1/10 + 1/20 = 3/20 per day. Time = 20/3 ≈ 6.67 days (6 days 16 hours).
Answer: 20/3 days
Q4: Sum of naturals
Problem: What is the sum of the first 50 natural numbers?
Solution: Sum of first n naturals = n(n+1)/2. For n = 50: 50 × 51 / 2 = 1275.
Answer: 1275
Q5: Average speed
Problem: A person covers a distance at 60 km/h and returns at 40 km/h. What is the average speed for the whole trip?
Solution: For equal distances, average speed = 2ab/(a+b). = 2×60×40 / (60+40) = 4800/100 = 48 km/h.
Do not take the arithmetic mean (50); that would be wrong here.
Answer: 48 km/h
Q6: Marked price discount
Problem: A shopkeeper marks goods 20% above cost and then gives a 10% discount. What is the profit percentage?
Solution: Let CP = ₹100. Marked price = ₹120. Discount = 10% of 120 = ₹12. SP = 120 − 12 = ₹108. Profit % = 8%.
Answer: 8%
Q7: 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
Q8: 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
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: Valid parentheses
Problem: Given a string containing only ‘()[]’, decide whether the brackets are balanced and correctly nested.
Approach: Scan left to right with a stack. Push opening brackets. On a closing bracket, the stack top must be the matching opener. At the end the stack must be empty.
Complexity: O(n) time, O(n) space
Tiger Analytics 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: 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
Tiger Analytics 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: 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
Tiger Analytics 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: 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
Tiger Analytics 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: 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
Tiger Analytics 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: 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
Tiger Analytics 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: 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
Tiger Analytics 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: 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)
Tiger Analytics 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 Tiger Analytics
How the Tiger Analytics assessment usually feels
Students usually say the first round is time-tight - easy marks vanish if you sit too long on one hard question. For Tiger Analytics, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Python, SQL.
Topic weight hints
| Area | Why it matters at Tiger Analytics |
|---|---|
| SQL | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Analytics & AI Consulting 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