Arcesium coding interview
questions, leaked.
20 problems reported across recent Arcesium interviews. Top patterns: array, dynamic programming, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Arcesium's interview is 14 medium problems and 6 hard ones, with zero easy gimmes. Arrays dominate at 60% of the problem set, followed by dynamic programming at 50%. You're looking at patterns like maximum subarray variants, tree traversals with DP, and binary search on answers. Most candidates bomb the DP problems because they drill LeetCode mediums without understanding how Arcesium chains multiple constraints together. If you hit a wall on the live assessment, StealthCoder runs invisibly beside your code and surfaces the solution in seconds so you don't lose momentum.
Top problems at Arcesium
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Cycle Length Queries in a Tree | HARD | 100.0 | 58% | Array · Tree · Binary Tree |
| 02 | Maximum Length of Subarray With Positive Product | MEDIUM | 100.0 | 44% | Array · Dynamic Programming · Greedy |
| 03 | Number of People Aware of a Secret | MEDIUM | 97.6 | 46% | Dynamic Programming · Queue · Simulation |
| 04 | Maximize the Confusion of an Exam | MEDIUM | 97.6 | 69% | String · Binary Search · Sliding Window |
| 05 | Count Collisions on a Road | MEDIUM | 97.6 | 44% | String · Stack · Simulation |
| 06 | Partition Array Into Two Arrays to Minimize Sum Difference | HARD | 95.0 | 22% | Array · Two Pointers · Binary Search |
| 07 | House Robber | MEDIUM | 80.5 | 52% | Array · Dynamic Programming |
| 08 | Search in Rotated Sorted Array | MEDIUM | 74.9 | 43% | Array · Binary Search |
| 09 | Stone Game VI | MEDIUM | 74.9 | 59% | Array · Math · Greedy |
| 10 | Possible Bipartition | MEDIUM | 74.9 | 52% | Depth-First Search · Breadth-First Search · Union Find |
| 11 | Next Permutation | MEDIUM | 67.8 | 43% | Array · Two Pointers |
| 12 | Binary Tree Maximum Path Sum | HARD | 67.8 | 41% | Dynamic Programming · Tree · Depth-First Search |
| 13 | Find the Count of Monotonic Pairs I | HARD | 67.8 | 46% | Array · Math · Dynamic Programming |
| 14 | Surrounded Regions | MEDIUM | 57.8 | 43% | Array · Depth-First Search · Breadth-First Search |
| 15 | Maximum Product Subarray | MEDIUM | 57.8 | 35% | Array · Dynamic Programming |
| 16 | Edit Distance | MEDIUM | 57.8 | 59% | String · Dynamic Programming |
| 17 | Minimum Insertion Steps to Make a String Palindrome | HARD | 57.8 | 72% | String · Dynamic Programming |
| 18 | Best Time to Buy and Sell Stock IV | HARD | 57.8 | 47% | Array · Dynamic Programming |
| 19 | Sort Colors | MEDIUM | 57.8 | 68% | Array · Two Pointers · Sorting |
| 20 | Pow(x, n) | MEDIUM | 57.8 | 37% | Math · Recursion |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Arcesium OA. The proctor cannot see it. Screen share cannot detect it. Made for the engineer who has done the work but might still blank with a webcam pointed at him.
Get StealthCoder- array12 · 60%
- dynamic programming10 · 50%
- string4 · 20%
- two pointers3 · 15%
- binary search3 · 15%
- math3 · 15%
- depth first search3 · 15%
- greedy2 · 10%
- sorting2 · 10%
- breadth first search2 · 10%
Array and DP are the core. Array problems here aren't just 'find the max', they're subarray optimization under constraints, like Maximum Length of Subarray With Positive Product and Maximum Product Subarray. DP problems lean toward game theory and state transitions, not textbook recurrence. Binary search appears 3 times but never standalone; it's always paired with another topic, meaning you need to recognize when to binary-search the answer space. Tree and DFS show up in hard problems like Cycle Length Queries and Binary Tree Maximum Path Sum, both of which require DP to track state during traversal. Two-pointers and greedy each appear 2-3 times but feel like bonus patterns rather than pillars. Start with array-DP hybrids first, then lock in tree-DFS-DP chains. When you sit down for the real assessment, StealthCoder is your hedge for the edge cases you didn't have time to trace through.
Companies with similar patterns
If you prepped for Arcesium, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Arcesium.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Made for the engineer who has done the work but might still blank with a webcam pointed at him. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Arcesium interview FAQ
How many array problems should I solve before my Arcesium OA?+
You need at least 8 to 10. Array is 12 of the 20 problems. Focus on subarray optimization, rotation, and prefix/suffix logic. Don't just grind variants; understand why each constraint exists and how it changes the approach.
Is DP really that important for Arcesium?+
Yes. DP appears in 50% of their problems and shows up in 6 of their top 10 hardest. Most are state-machine or choice-based DP, not simple recurrence. Study House Robber, Maximum Product Subarray, and Partition Array Into Two Arrays first.
Should I study binary search if it's only 3 problems?+
Yes, but study it paired with other skills. All 3 binary search problems here also use arrays, sliding windows, or prefix sums. Learn to binary-search the answer space, not just sorted arrays.
How should I approach tree problems for Arcesium?+
All 2 tree problems involve DP or DFS. Cycle Length Queries and Binary Tree Maximum Path Sum both require you to track state as you traverse. Practice tree traversal with DP state management, not just DFS itself.
What's the hardest topic to prepare for in one week?+
Game theory and DP combos, like Stone Game VI. These require both algorithmic knowledge and game-state reasoning. If you're short on time, drill the 6 hard problems directly; they're representative of what you'll actually see.