Skip to content

Fractal Analytics Placement Papers 2024

Overview

This page collects Fractal Analytics 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 Fractal Analytics patterns and recent shifts.

Fractal 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

Fractal Analytics 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: Fractal Online Assessment
Skills emphasized: Aptitude, SQL, case/analytics, Python
Languages: Python, SQL, R

Sample Fractal Analytics questions with solutions

These are practice-style questions aligned to patterns students report for Fractal Analytics 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: 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%

Q2: 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

Q3: 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

Q4: 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

Q5: 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

Q6: 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

Q7: 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

Q8: 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

Logical reasoning (2024)

Q1: 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

Q2: Series multiply

Problem: Find the next number: 3, 9, 27, 81, ?

Solution: Each term is multiplied by 3. Next = 81 × 3 = 243.

Answer: 243

Q3: 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

Q4: 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

Coding practice (2024)

Coding Q1: 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

Fractal 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: 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

Fractal 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: 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

Fractal 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: 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)

Fractal 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: 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

Fractal 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: 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

Fractal 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: Rotate array

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

Fractal 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: First unique character

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

Fractal 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 Fractal Analytics

How the fractal 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 Fractal Analytics, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Python, SQL, R.

Topic weight hints

Area Why it matters at Fractal Analytics
Aptitude What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
AI & Analytics Consulting awareness Helps in managerial / HR conversations
Communication Explain your approach clearly; keep a few real examples ready for HR

14-Day sprint

  1. Days 1-3: Learn the 2024 pattern and take two sectional mocks
  2. Days 4-7: Closed practice on weak topics from your error log
  3. Days 8-10: Full mocks every other day; review the same day
  4. Days 11-14: Practice explaining projects out loud, light revision, sleep and IDs ready

Comments & Suggestions

Similar companies

Tiger Analytics · Mu Sigma · ZS Associates · EXL · Optum