Learn from Arcesium India SDE and summer-internship campus experiences. We synthesized public write-ups into round tables and prep takeaways - cutoff-based OA sections, long DSA CodePair rounds, and a thorough HR resume read.
Reported Q themes: maximize shop discount when indices divisible by a/b get c1/c2; min operations transforming start→end string changing one char at a time with word list (ladder)
Funnel: 12 of 120 shortlisted in that account
Tip: Aptitude is intentionally tight - do not let it sink a strong coding score if cutoffs are per-section
Round 2 - Technical (~40 min)
C++ compilation pipeline end-to-end
Process vs thread → filesystem discussion
Hash map collisions
Code: deep-copy a tree from root pointer
Result: Advanced (7 called next in that account)
Round 3 - Technical (~90 min)
JS compiled vs interpreted discussion opener in one account
Rotate linked list; array rotation; indices of two numbers in sorted array summing to zero; prime factorization
Result:4 advanced in that funnel
Later rounds / HR
Further technical depth then HR fit (varies by campus)
Tip: Expect full-day stamina - rounds stack
Takeaways
What decided it: Clearing every OA section cutoff, then shipping tree-copy and rotation/DSA code across stacked technicals
Common fail: Letting aptitude/negative marking sink a strong coding score when cutoffs are per-section
How to practise: Timed sectioned OA mocks with −0.25 awareness; drill deep-copy tree, list/array rotation, and two-sum-to-zero
Outcome: Selected in this account; other candidates report strong tech/HM feedback but rejection without detailed HR rationale - treat the funnel as competitive end-to-end
Takeaways
What decided it: Finishing both OA DSA cleanly (pivot/binary-search + topological sort) and holding multi-round DB/DSA depth
Common fail: Partial OA submissions, or claiming DBMS without ACID durability follow-through
How to practise: Solve two medium DSA end-to-end under 60 minutes; rehearse ACID durability with a concrete failure example
Final result: Offer when selected (e.g. 2-intern cohorts)
Key takeaways: HR at Arcesium is still resume-substantive. Do not list projects you cannot demo live.
Sample answers for high-frequency questions
Use these as frames, not scripts.
Technical
Q. Minimum Path Sum - optimise from recursion. A. Recurse right/down → memoize (i,j) → DP table dp[i][j] = grid + min(up,left) → roll arrays for O(cols) space. State complexities at each step.
Q. Copy a binary tree given root. A. Recursive deep copy: new node, copy left, copy right. Discuss queue BFS alternative and pointer aliasing bugs if shallow.
Q. Two indices in sorted array summing to zero. A. Two pointers L/R; move based on sign of sum. O(n) after sort (already sorted). Handle duplicates if required.
Q. ACID - focus on Durability? A. Once committed, data survives crashes via WAL/fsync/replication depending on engine. Contrast with acknowledging commit before flush (risk window).
HR / fit
Q. Walk me through this project on your resume. A. Problem → users → architecture → your commits → hardest bug → what you would rebuild. Offer a 60-second and a 5-minute version.
Common questions checklist
OA
Timed aptitude with negative marks; CS MCQs; 2 coding with cutoffs
These links are research inputs we used to map round structure and recurring questions - not copied page mirrors. We reorganized reports into process tables, outcome notes, and prep takeaways for Arcesium.
Ready to prepare? Train section cutoffs on OA, then practise medium DSA aloud with complexity at every step - Arcesium panels listen for that narration.
Pro tip: Published funnels shrink to low double-digits after OA; consistency across stacked CodePair rounds matters more than one flashy hard problem.
