Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Fractal Analytics Online Assessment

Overview

Here is how public prep guides and student write-ups describe the Fractal Analytics online assessment. This is not an official company brochure.

Imagineer program with multi-week pre-onboarding training before the formal offer is a recurring from student reports step.

Usual selection rounds

Rounds students usually mention: Resume screen → Aptitude/coding OA (~90 min) → Technical interviews → Managerial/Apex or business understanding → HR

Item From student reports
Platform Online assessment
Online test summary Referral/job posts: ~90-minute test covering quants, logical, SQL, Python coding. Off-campus GFG: separate aptitude then coding+tech MCQ stages.
Eligibility notes Often 7.0+ throughout; VIT campus account cited 8.0+ for that drive
Branches (reported) Circuit branches CS/IT/ECE/EEE/AI etc.; MSc/MA Eco/Stats in some Imagineer drives

Online test sections

Section Questions Time Notes
Aptitude / logical - part of ~90 min -
SQL + Python coding - - Core Imagineer skills

Extra notes from sources

  • Check your college placement email for the platform, section order, and timing.

Sample practice question styles

These are practice questions for speed - not claimed to be from a real Fractal Analytics live paper.

Coding Q1: Stack with min

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

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: Maximum subarray sum (Kadane)

Problem: Given an integer array, find the contiguous subarray with the largest sum and return that sum. Example: [-2,1,-3,4,-1,2,1,-5,4] → 6 (from [4,-1,2,1]).

Approach: Keep a running sum. If the running sum drops below 0, reset it to 0 before taking the next element (or track the best ending-here value). Track the global maximum as you scan once from left to right.

Complexity: O(n) time, O(1) extra 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: Reverse a string in place

Problem: Given a mutable character array representing a string, reverse it in place without allocating another array of the same size.

Approach: Use two pointers at the start and end. Swap characters, then move inward until the pointers meet. Watch empty and single-character inputs.

Complexity: O(n) time, O(1) extra 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: Check prime

Problem: Write a function that returns true if n is prime and false otherwise. Handle n < 2 correctly.

Approach: Return false for n < 2. Trial-divide from 2 to floor(sqrt(n)). If any divisor divides n evenly, it is composite; otherwise prime.

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.

Prep tips from those student reports

  1. SQL + Python + aptitude for 90-min OA
  2. Project storytelling
  3. Expect pre-onboarding training gate after selection

Sources

These notes come from public reports and can differ by campus, year, and role. If your college placement email or the official careers/notification PDF says something different, follow that.

Comments & Suggestions

Coding questions

Aptitude questions

Interview experience

Fractal Analytics hub

Similar companies

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