Skip to content

Arcesium Placement Papers 2024

Overview

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

Arcesium 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

Arcesium exam pattern 2024

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: Arcesium Online Assessment
Skills emphasized: DSA, systems, finance workflows
Languages: Java, Python, C++

Sample Arcesium questions with solutions

These are practice-style questions aligned to patterns students report for Arcesium 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: Compound ratio

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

Q2: SI three years

Problem: Find simple interest on ₹5000 at 8% per annum for 3 years.

Solution: SI = 5000 × 8 × 3 / 100 = ₹1200.

Answer: ₹1200

Q3: Boat upstream

Problem: A boat’s speed in still water is 15 km/h and the stream is 3 km/h. How long to cover 36 km upstream?

Solution: Upstream speed = 15 − 3 = 12 km/h. Time = 36 / 12 = 3 hours.

Answer: 3 hours

Q4: Mixture milk

Problem: A mixture has milk and water in the ratio 4:1. If 5 litres of water are added to 20 litres of mixture, what is the new milk:water ratio?

Solution: In 20 L: milk = 16 L, water = 4 L. After adding 5 L water: milk 16, water 9. Ratio = 16:9.

Answer: 16:9

Q5: CI vs SI hint

Problem: Find compound interest on ₹10,000 at 10% per annum for 2 years, compounded annually.

Solution: Amount = 10000 × (1.1)² = 10000 × 1.21 = ₹12,100. CI = 12100 − 10000 = ₹2100. (SI for same period would be ₹2000; the extra ₹100 is interest on first-year interest.)

Answer: ₹2100

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

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

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

Coding practice (2024)

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

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

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

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

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

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

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

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

Arcesium 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 Arcesium

How the Arcesium 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 Arcesium, skim the paper in a couple of minutes, mark what you can finish cleanly, and protect accuracy. Languages people commonly use: Java, Python, C++.

Topic weight hints

Area Why it matters at Arcesium
DSA What usually helps you clear the first round
Core CS (OOPs / DBMS / OS) Technical interview depth
FinTech Platforms (D. E. Shaw spinout) 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

D. E. Shaw · Goldman Sachs · BlackRock · Oracle