Zerodha 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
This page collects Zerodha 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 Zerodha patterns and recent shifts.
Zerodha 2025 aptitude
Quantitative, reasoning, and verbal drills with solutions
Zerodha 2025 coding
DSA practice aligned to Zerodha online assessments
Zerodha interview experience
Round structure and tips from student reports
Zerodha 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.
Quantitative
If Thursday was the day after the day before yesterday five days ago, what is the least number of days ago when Sunday was three days before the day after tomorrow?
Correct answer: Requires careful day calculation (typically 2-4 days ago)
Quantitative
If the sum of the first 50 natural numbers is S, what is the value of S?
Sum of first n natural numbers = n(n + 1)/2 For n = 50: S = 50 × 51 / 2 = 1275
Reasoning
Series: 1, 4, 9, 16, 25, ?
Perfect squares → 36.
Verbal
Problem: Choose the correct sentence: a) She likes reading, writing, and to dance b) She likes reading, writing, and dancing c) She likes to read, writing, and dancing
Parallel structure requires same form: all gerunds or all infinitives. Option b maintains parallelism with all gerunds.
Quantitative
The average of 6 numbers is 25. If one number is 30, what is the average of the remaining 5 numbers?
Correct answer: 24
Reasoning
If in a certain code, FLOOR is written as EKNQQ, how is TABLE written?
Each letter −1: T→S, A→Z, B→A, L→K, E→D → SZAKD.
Verbal
Choose the correct form: "Neither the teacher nor the students _____ present."
Correct answer: were
Quantitative
A mixture contains milk and water in the ratio 5:3. If 10 liters of water is added, the ratio becomes 5:4. Find the quantity of milk in the mixture.
Let milk = 5x, water = 3x After adding 10 liters water: Milk = 5x, Water = 3x + 10 Ratio: 5x/(3x + 10) = 5/4 20x = 5(3x + 10) 20x = 15x + 50 5x = 50 x = 10 Quantity of milk = 5x = 5 × 10 = 50 liters
Reasoning
All cats are dogs. Some dogs are rats. Conclusions: I. Some cats are rats. II. Some rats are dogs.
II follows from "some dogs are rats". I does not necessarily follow.
Reasoning
How many 9s are there between 1 and 100?
9,19,29,39,49,59,69,79,89,90-99 → 20 nines.
Verbal
A bouquet of flowers _____ on the table.
Bouquet is singular.
Quantitative
If "CAT" is coded as "3120", "DOG" is coded as "4157", then how is "RAT" coded?
Pattern analysis: - C = 3, A = 1, T = 20 → "3120" - D = 4, O = 15, G = 7 → "4157" Pattern: Position of letter in alphabet For "RAT": - R = 18 - A = 1 - T = 20
Quantitative
A is twice as efficient as B. Together they complete a work in 12 days. In how many days will A alone complete it?
Let B's efficiency = 1 unit/day A's efficiency = 2 units/day Together: 1 + 2 = 3 units/day Total work = 3 × 12 = 36 units A alone: 36 / 2 = 18 days
Reasoning
If P means +, Q means −, R means ×, then 18 R 2 P 6 Q 4 = ?
18 × 2 + 6 − 4 = 36 + 6 − 4 = 38.
Verbal
There are two pipes in a tank. Pipe A is for filling the tank and pipe B is for emptying the tank. If A can fill the tank in 10 hours and B can empty the tank in 15 hours then find how many hours will it take to completely fill a half empty tank?
Correct answer: 15 hours
Your score
0/15(0%)
| Section | What shows up | Prep focus |
|---|---|---|
| Online assessment | Coding and/or MCQ filter | Weekly timed mocks |
| Technical rounds | DSA, CS fundamentals, projects | Live problem solving |
| HR / hiring manager | Motivation and communication | Specific, evidence-based answers |
First round: Zerodha Assignment / Interviews
Skills emphasized: DSA, systems, markets curiosity
Languages: Go, Python, JavaScript
These are practice-style questions aligned to patterns students report for Zerodha drives around 2025. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Problem: A number is increased by 20% and then decreased by 20%. What is the net percentage change?
Solution: Start with 100 → 120 → 96. Net change = 4% decrease. Formula: successive +a then −a gives −(a²/100)% = −4%.
Answer: 4% decrease
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: 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
Zerodha 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
Zerodha 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)
Zerodha 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
Zerodha 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
Zerodha 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
Zerodha 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
Zerodha 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: Design a stack that supports push, pop, top, and getMin in average O(1) time.
Approach: Keep a parallel min-stack (or store pairs). When pushing, also push the new minimum. When popping, pop both stacks.
Complexity: O(1) per operation amortized
Zerodha 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 Zerodha, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Go, Python, JavaScript.
| Area | Why it matters at Zerodha |
|---|---|
| DSA | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Discount Brokerage, FinTech awareness | Helps in managerial / HR conversations |
| Communication | Explain your approach clearly; keep a few real examples ready for HR |