Citi 2024 aptitude
Quantitative, reasoning, and verbal drills with solutions
Citi Placement Papers 2024
Overview
This page collects Citi placement papers from 2024 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 Citi patterns and recent shifts.
Download / jump links
Citi 2024 coding
DSA practice aligned to Citi online assessments
Citi interview experience
Round structure and tips from student reports
Citi prep guide
Study plan and weekly schedule
Citi 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
Find x: 2/3 of x = 48. x =
x = 48 × 3/2 = 72.
Quantitative
Identify the next shape in the sequence: Circle, Square, Triangle, Circle, Square, ?
The sequence repeats every three shapes: Circle, Square, Triangle After Circle and Square, the next shape is Triangle
Quantitative
If 20% of a number is 48, the number is:
Number = 48 × 100/20 = 240.
Quantitative
A sum doubles in 5 years at simple interest. The rate of interest is:
For doubling, RT = 100 → R = 100/5 = 20%.
Quantitative
A can complete a work in 12 days, B in 15 days, and C in 20 days. If they work together, in how many days will they complete the work?
Let total work = LCM of 12, 15, 20 = 60 units A's efficiency = 60/12 = 5 units/day B's efficiency = 60/15 = 4 units/day C's efficiency = 60/20 = 3 units/day Combined efficiency = 5 + 4 + 3 = 12 units/day Time taken = 60/12 = 5 days
Verbal
Antonym of "Benevolent":
Benevolent ↔ malevolent.
Reasoning
Find next number: 2, 5, 10, 17, 26, ?
Pattern: Differences are 3, 5, 7, 9 (odd numbers) Next difference = 11 Next number = 26 + 11 = 37
Verbal
Neither of the options _____ correct.
Neither takes singular.
Reasoning
Series: 1, 4, 9, 16, 25, ?
Perfect squares → 36.
Reasoning
Find the next number: 1, 8, 27, 64, 125, ?
Correct answer: 216
Reasoning
Find the next number: 5, 10, 20, 40, ?
×2 each → 80.
Quantitative
Find next letter: B, E, H, K, ?
Pattern: B(+3)→E(+3)→H(+3)→K(+3)→N Next letter = N
Verbal
Synonym of "Vivid":
Vivid means bright.
Reasoning
Odd one out: 8, 27, 64, 100, 125
Others are perfect cubes; 100 is not.
Verbal
Identify the correctly spelled word:
Accommodate has double "c" and double "m".
Your score
0/15(0%)
Review
Citi exam pattern 2024
| 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: Citi Online Assessment
Skills emphasized: Aptitude, coding, finance domain
Languages: Java, Python, SQL
Sample Citi questions with solutions
These are practice-style questions aligned to patterns students report for Citi drives around 2024. They are not leaked live papers. Work them timed, then read the solutions only after you have an answer.
Quantitative aptitude (2024)
Q1: Clock angle
Problem: What is the angle between the hour and minute hands at 3:00?
Solution: At 3:00 the hands are exactly 90° apart (one quarter of the circle).
Answer: 90°
Q2: Permutation basic
Problem: In how many ways can 5 different books be arranged on a shelf?
Solution: Arrangements of 5 distinct items = 5! = 120.
Answer: 120
Q3: Consecutive integers
Problem: If the sum of three consecutive integers is 72, what is the smallest of these integers?
Solution: Let the integers be x, x+1, and x+2.
x + (x+1) + (x+2) = 72 3x + 3 = 72 3x = 69 x = 23
So the integers are 23, 24, and 25.
Answer: 23
Q4: 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
Q5: 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
Q6: 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
Q7: 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
Q8: 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
Logical reasoning (2024)
Q1: Syllogism
Problem: Statements: All engineers are graduates. Some graduates are managers. Conclusion: Some engineers are managers. Does it follow?
Solution: The ‘some graduates’ who are managers need not overlap with the engineers. The conclusion does not follow necessarily.
Answer: Does not follow
Q2: Direction turn
Problem: A person walks 5 km north, then 3 km east, then 5 km south. How far is he from the start, and in which direction?
Solution: North 5 and south 5 cancel. He is 3 km east of the start.
Answer: 3 km east
Q3: Series multiply
Problem: Find the next number: 3, 9, 27, 81, ?
Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.
Answer: 243
Q4: Seating hint
Problem: Five friends sit in a row. A is to the left of B but right of C. D is to the right of B and left of E. Who is in the middle?
Solution: Order from left to right: C, A, B, D, E. The middle seat is B.
Answer: B
Coding practice (2024)
Coding Q1: 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
Citi 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: 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
Citi 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: 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
Citi 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: 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
Citi 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: 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
Citi 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: 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)
Citi 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 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
Citi 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: Move zeros
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
Citi 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 Citi
How the Citi Online 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 Citi, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, SQL.
Topic weight hints
| Area | Why it matters at Citi |
|---|---|
| Aptitude | What usually helps you clear the first round |
| Core CS (OOPs / DBMS / OS) | Technical interview depth |
| Global Banking 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 2024 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
Barclays · Bank of America · HSBC · JP Morgan · Deutsche Bank