Interview experience
Arcesium interview experiences covering Online Assessment, Technical Interview 1, Technical Interview 2, HR Round. Round-wise notes, common questions, and what candidates report clears each stage.
Explore: Interview experience · HR interview questions · Overview · Placement papers · Preparation guide
Arcesium is a D. E. Shaw-affiliated fintech, and its interview loop reflects that lineage: fewer rounds than a typical services company, but each one is DSA- and design-heavy with a real bar for correctness.
Interview experience
Arcesium interview experiences covering Online Assessment, Technical Interview 1, Technical Interview 2, HR Round. Round-wise notes, common questions, and what candidates report clears each stage.
HR interview questions
Arcesium HR interview questions with sample answer frameworks - motivation, relocation, STAR stories, and culture-fit prompts.
| Round | Duration | What they test |
|---|---|---|
| Online Assessment | 60-90 min | Technical/aptitude MCQs (DSA, OS, C/C++/Java) + 2-3 coding problems |
| Technical Interview 1 | 40-60 min | DSA, problem-solving, code correctness |
| Technical Interview 2 | 40-60 min | Low-level design, DBMS, OS, deeper CS fundamentals |
| HR Round | 20-30 min | Fit, expectations, motivation |
These answers are compiled from public candidate reports and prep guides, not from an official notice, and drives differ. The instruction screen of your own test is the final word.
| Question | Answer |
|---|---|
| How many questions and how long? | Campus OAs usually have three timed sections: about 15 aptitude questions in 20 minutes, about 15 CS fundamentals MCQs in 15 minutes, and 2 coding questions (one report gives 45 minutes for coding). Some 2024 off-campus OAs drop the MCQs and set 3 coding problems (one easy, two medium-hard). |
| Does it have negative marking? | Yes, on the MCQs. Reports from 2021 through a March 2026 Bangalore review describe a 25% deduction for each wrong MCQ answer. The coding questions are scored on test cases. |
| Is there a sectional cutoff? | Not published, but sections are separately timed and some drives do not let you return to aptitude once you move on, so give each section its full effort. |
| How much is the cutoff? | Not published; shortlists are relative to the batch and can be steep. One August 2024 intern report says 150 students reached the coding stage and 12 reached interviews. Candidate-reported eligibility is often 7.5+ CGPA with no active backlogs. |
| Which platform is it on? | HackerRank, in most campus and off-campus reports. |
| Is there coding? How hard? | Yes - 2 or 3 problems, medium to hard, and partial or brute-force solutions rarely get you shortlisted. Reported problems include 0-1 knapsack, connecting graph nodes by GCD, a Jump Game VII-style problem and an implementation question. |
| What do the MCQs cover? | Java-heavy CS fundamentals: OOP, threads, AVL trees, heaps, OS and DBMS, often with Java pseudo-code output questions. |
These themes come from candidate reports on Glassdoor, GfG, LeetCode Discuss and Code360. They show the level and style, not a fixed list.
| Role | Reported questions and topics |
|---|---|
| SDE intern (campus) | Tree questions followed by a coding problem that must be fully optimised (one candidate was rejected for not reaching the optimal solution). BST to greater-sum tree. Questions around OOP, DBMS and OS with more weight on DSA (2023 Gurgaon campus report). |
| SDE-1 / new grad | One problem-solving round and one OOP, OS and DBMS round, then a managerial round (2025 report). Binary exponentiation with modulo, K nearest points with a heap, matrix transformation to a target, AVL and red-black trees, Snake and Ladders LLD. |
| Software engineer (1-2 years) | Five rounds in a 2024 report: HackerRank OA with 3 DSA problems, DSA problem solving, OOP and design patterns, and a project discussion. Java/Spring Boot depth and SQL in the hiring manager round. |
| Database / design round | Schema for a cab management system with joins, indexes and normalisation trade-offs; employee-manager hierarchy SQL. |
Asked across every role: a deep walk through your resume project and the choices you made, threads vs processes, normal forms, and why Arcesium.
Hosted on HackerRank: a mix of technical/aptitude MCQs (DSA, OS, C/C++/Java basics) plus 2-3 coding problems, usually medium-to-hard difficulty. Candidates report the OA turning around within a couple of days of applying, and only those who solve the coding problems cleanly tend to get shortlisted for interviews. Recent SDE-1 reports (2025-26) describe tree- and graph-shaped OA problems - pivot-finding in binary search, topological sort - alongside classic array/string work; some drives use section timers so you cannot return to aptitude after jumping to coding.
Common questions
A 40-60 minute round focused purely on data structures and algorithms - arrays, linked lists, trees (including AVL/red-black tree questions), and hashing. Interviewers push on edge cases and correctness rather than accepting the first working solution. Public SDE-1 accounts mention binary exponentiation (power with modulo), K nearest points with a heap, and matrix transformation problems where you may add or subtract 1 on full rows/columns to match a target matrix.
Common questions
This round is what distinguishes Arcesium from a typical DSA-only loop. Expect a low-level design problem (one public account describes designing an extensible Snake and Ladders game), DBMS normalization questions, and OS concepts like threads vs processes. Some loops add a dedicated database-design round - e.g. schema for a cab management system with joins, indexes, and normalization trade-offs - or a Dijkstra variation plus resume deep-dive on ownership.
Common questions
Full round-by-round accounts are on the Arcesium interview experience page.
Not every campus drive includes a separate HM stage, but 0-2 YOE SDE-1 reports often add a Hiring Manager round after two technicals: deep Java/Spring Boot or resume-stack grilling, one LLD prompt, and SQL - even when the calendar title says “technical.” HM may probe teamwork and decision-making when tech rounds already passed; feedback can stay opaque, so treat communication and consistency with earlier answers as part of the score.
A shorter closing conversation (20-30 minutes) on fit, compensation structure, and joining logistics. Selected candidates report this round covering notice period and offer details rather than deep behavioral probing. Intern accounts describe resume read-aloud, live project demos (including games), and occasional questions about other offers for internal benchmarking.
Common questions
Sample answer frameworks for each of these are on the Arcesium HR interview questions page.
Unlike most fresher-level interviews that stop at DSA, Arcesium’s second technical round routinely includes a genuine low-level design problem - not just “explain OOP concepts,” but actually designing an extensible class structure for something like a board game or booking system. This mirrors the design rigor expected at D. E. Shaw itself, since Arcesium builds and operates the financial data platforms that D. E. Shaw and other institutional investors rely on. Candidates who only prep DSA and skip LLD basics (SOLID principles, class design, extensibility) are the ones most likely to stall in round two.
Arcesium and D. E. Shaw are often confused because Arcesium started as an internal technology platform inside D. E. Shaw before spinning out in 2015 as a separate company.
D. E. Shaw India hires software developers and quantitative roles for the hedge fund itself, and its loop is known for very hard DSA and puzzles. Arcesium is a fintech that builds post-trade, fund accounting and data platforms for D. E. Shaw and other institutional investors; its loop puts more weight on LLD, SQL and DB design alongside DSA.
They are separate employers with separate applications, OAs and offers. This page covers Arcesium; see the D. E. Shaw hub for the fund’s own process.
Use Floyd’s tortoise-and-hare: advance a slow pointer one node and a fast pointer two nodes per step. If they ever meet, a cycle exists; if fast reaches null, the list is acyclic. To find the cycle’s entry point, reset slow to the head and advance both pointers one step at a time - they meet at the start of the loop, because the distance from head to loop start equals the distance from the meeting point to loop start. This runs in O(n) time and O(1) space, which is the answer Arcesium interviewers push for after you offer the hash-set version.
An AVL tree is a self-balancing BST where the height difference between left and right subtrees of every node is at most 1, restored by single or double rotations after insert/delete. A red-black tree relaxes this: it colours nodes red or black and only guarantees that the longest root-to-leaf path is at most twice the shortest, so it is less rigidly balanced. Both give O(log n) search, insert and delete, but AVL trees are faster for lookup-heavy workloads because they are shorter, while red-black trees perform fewer rotations on writes, which is why they back most standard-library maps.
Model the pieces as separate classes: a Board holding a map of jump positions, a Jump (or Snake/Ladder) entity with start and end cells, a Player with a current position, a Dice abstraction, and a Game class owning the turn loop. Keep the dice behind an interface so a six-sided die, a loaded die, or multiple dice are drop-in replacements, and express special rules (exact roll to finish, extra turn on a six) as pluggable rule objects rather than if-branches inside the loop. This follows open/closed: adding a new snake type or rule means adding a class, not editing the game loop, which is exactly the extensibility Arcesium probes for.
1NF requires every column to hold a single atomic value with no repeating groups. 2NF adds that every non-key column must depend on the whole composite primary key, not just part of it. 3NF further removes transitive dependencies, so no non-key column depends on another non-key column. Denormalization is justified in read-heavy reporting or analytics paths where a join across several normalized tables is too slow - you accept duplicated data and the cost of keeping it consistent in exchange for fewer joins, which is a common trade-off in financial reporting platforms.
A process is an independent execution unit with its own virtual address space, file descriptors and heap; a thread is a unit of execution inside a process that shares that address space and heap with its sibling threads while keeping its own stack, registers and program counter. Context switching between threads is cheaper because the memory mappings do not change, and threads communicate through shared memory rather than IPC. The cost is safety: a crash or memory corruption in one thread takes down the whole process, and shared state needs locks, whereas processes are isolated by the OS.
The simplest correct approach in Java is an eager static final instance initialised at class load, since the JVM guarantees class initialisation happens once and is thread-safe. If lazy initialisation is required, use double-checked locking with the instance field declared volatile - without volatile, another thread can observe a partially constructed object because the constructor’s writes may be reordered after the reference assignment. An even cleaner lazy option is the holder idiom: a private static nested class holding the instance, which the JVM initialises only on first access. Also guard against reflection and deserialization if the singleton must be strict.
Compute a running prefix sum and store the first index at which each prefix value was seen in a hash map. At index i with prefix sum S, if the map contains S minus k, then the subarray after that stored index up to i sums to k, so the candidate length is i minus that index. Keep the maximum such length and only insert a prefix sum the first time you see it, so the subarray found is the longest. This is O(n) time and O(n) space, and it handles negative numbers, which the sliding-window approach does not.
Single responsibility means a class has one reason to change; open/closed means you extend behaviour by adding classes rather than editing existing ones; Liskov substitution means a subclass must be usable anywhere its parent is without breaking callers; interface segregation means many small interfaces beat one fat one; dependency inversion means depend on abstractions, not concrete classes. In practice an Arcesium interviewer checks these implicitly - if adding a new rule or new dice type to your design forces you to modify the game loop, you have violated open/closed and dependency inversion at once.
Use binary exponentiation: if n is even, pow(x, n) = pow(x*x, n/2); if odd, multiply an extra x. Accumulate the result modulo m at each multiply to avoid overflow. This is O(log n) multiplications versus O(n) naive looping - a reported SDE-1 prompt where interviewers expect both the code and a clear complexity justification.
Self-join the Employees table: alias it as e and m, join e.manager_id = m.employee_id, select e.name and m.name as manager. If manager_id can be null for the CEO row, use a LEFT JOIN so top-level employees still appear. Follow-ups often ask for second-highest salary or headcount per company - same join patterns with GROUP BY.
Yes, on the MCQ sections. Candidate reports from 2021 through 2026 describe a 25% deduction for each wrong answer in the aptitude and CS fundamentals MCQs. The coding questions are scored on test cases, so skip MCQs you are unsure of rather than guessing.
Usually three timed sections on HackerRank: about 15 aptitude questions in 20 minutes, about 15 Java-heavy CS fundamentals MCQs in 15 minutes, and 2 medium-to-hard coding questions. Some 2024 off-campus OAs set 3 coding problems with no MCQs. Cutoffs are not published and shortlists are small.
Arcesium campus hiring typically runs 3-4 stages: an Online Assessment on HackerRank (technical/aptitude MCQs plus 2-3 coding problems), followed by 2 in-depth Technical Interviews (40-60 minutes each, often back-to-back on the same day, one DSA-heavy and one covering LLD/DBMS/OS) and a final HR round. Only candidates who solve the coding problems fully are usually shortlisted for interviews.
Arcesium interviews lean heavily on data structures and algorithms (array/string manipulation, linked lists, trees like AVL/red-black), low-level design (e.g. designing a Snake and Ladders game or a singleton class), DBMS normalization and sometimes a dedicated database-design round, and OS concepts like threads vs processes. As a fintech affiliated with D. E. Shaw handling large-scale financial data, expect follow-up questions on correctness and edge cases, not just a working solution.
Arcesium typically runs 3-4 rounds: an Online Assessment, 2 Technical Interviews (40-60 min each, sometimes with a third round added for database design or a resume-deep-dive), and an HR round. Rounds 2 onward often happen consecutively on the same day with no waiting time between them.
Yes - reported experiences back that up. Candidates describe medium-to-hard DSA problems with real edge-case scrutiny, plus a genuine low-level design round (one public account describes being asked to design an extensible Snake and Ladders game) rather than a quick whiteboard sketch. As a DE Shaw-affiliated firm building trading and fund infrastructure, Arcesium’s bar for correctness and design reasoning is closer to a top-tier product company than a typical services or even fintech interview.
For Arcesium, be strong on DSA fundamentals (arrays, linked lists, trees, hashing) and core CS (DBMS normal forms, OS threading, OOP/LLD) - Arcesium builds mission-critical financial data infrastructure, so interviewers probe correctness and reasoning depth, not just a working answer. Practise a couple of classic LLD problems (parking lot, Snake and Ladders, elevator) and explaining trade-offs out loud, since communication is scored alongside code.
Arcesium began as an internal platform inside hedge fund D. E. Shaw & Co. before spinning out as a separate fintech company. It still builds and operates financial data and technology infrastructure for D. E. Shaw and other institutional investors, which is why its interview bar and technical culture are frequently compared to D. E. Shaw’s own hiring process.
Commonly OA → 2-3 technicals (DSA + projects) → LLD/DB design → HR.
Harder than average campus product companies on DSA + SQL combo. Negative marking on MCQs (25% per wrong answer in most reports) is a common trap.
Often roughly ₹20-35 LPA for early SWE. Confirm the letter.
Arcesium scores medium-hard DSA, SQL/DB design, OOP/OS concurrency, and comfort with finance-workflow systems (post-trade, fund accounting) without requiring a CFA.
| Signal | What a strong answer looks like |
|---|---|
| OA | MCQs plus two coding problems; watch negative marking if stated |
| SQL | Joins, employee-manager queries, normalisation explained |
| LLD / schema | Clean entities for a finance workflow when asked |
| Hyderabad hub | Relocation clarity |
Why Arcesium / D. E. Shaw tech heritage, learning markets domain, teamwork, and compensation realism. Prep:
Frameworks: Arcesium HR interview questions.
Use this as a default four-week loop before a Arcesium drive. Adjust to your invite timeline.
10-day crash version: Days 1-4 timed DSA, days 5-7 resume projects + CS fundamentals, days 8-9 mock interviews out loud, day 10 HR STAR stories on the HR page.
Candidate-reported fresher/early-career packages for Arcesium often cite ₹20-35 LPA. Treat forum numbers as ranges, not guarantees - confirm the written offer letter for your team and location.
Interview process details and sample questions on this site are editorially organized from public candidate reports and hiring write-ups, with round structure, prep notes, and company-specific framing added by our team. For round-by-round stories, see the Arcesium interview experience page. For OA papers and coding drills, use Arcesium on placementpapers.app. OA quick answers and role-wise questions draw on Glassdoor candidate reviews for Arcesium (2023-2026), GfG and Code360 Arcesium interview experiences, and a 2024 LeetCode Discuss SE report.