DSA Doctor
Verified Company Vault
Arcesium DSA Interview Questions
15 curated coding interview questions directly asked in Arcesium technical rounds, sorted by frequency with recency and difficulty diagnostics.
15
Total Questions
0 (0%)
Easy Problems
8 (53%)
Medium Problems
7 (47%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (6)Arrays (4)Dynamic Programming (3)Trees (2)Strings (2)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2509 | Cycle Length Queries in a Tree | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 60.4% | 100.0% | all |
| 2024 | Maximize the Confusion of an Exam | Medium | Core DSA | Implementation / Reasoning | 70.0% | 100.0% | all |
| 1567 | Maximum Length of Subarray With Positive Product | Medium | Arrays | Sorting / Prefix / Scan | 44.7% | 100.0% | all |
| 2211 | Count Collisions on a Road | Medium | Core DSA | Implementation / Reasoning | 58.1% | 100.0% | all |
| 2327 | Number of People Aware of a Secret | Medium | Core DSA | Implementation / Reasoning | 60.8% | 100.0% | all |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 23.4% | 100.0% | all |
| 2560 | House Robber IV | Medium | Dynamic Programming | State Transition | 64.7% | 87.5% | all |
| 3250 | Find the Count of Monotonic Pairs I | Hard | Core DSA | Implementation / Reasoning | 47.5% | 75.0% | all |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | Arrays | Sorting / Prefix / Scan | 65.6% | 75.0% | all |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 62.5% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |