Arcesium coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Partition Array Into Two Arrays to Minimize Sum DifferenceMeet in the Middle | Hard | Solve | |
| Russian Doll Envelopes1D DP | Hard | Solve | |
| Median of Two Sorted ArraysBinary Search on Partition | Hard | Solve | |
| Count Collisions on a RoadStack Basics | Medium | Solve | |
| Find Median from Data StreamAdvanced | Hard | Solve | |
| Longest Consecutive SequenceHash Set Lookup | Medium | Solve | |
| Sudoku Solver2D Matrix Backtracking | Hard | Solve | |
| Maximal RectangleMonotonic Stack | Hard | Solve | |
| Word LadderBFS for shortest path | Hard | Solve | |
| Longest Substring Without Repeating CharactersSliding Window · Variable | Medium | Solve | |
| Koko Eating BananasBinary Search on Answer Space | Medium | Solve | |
| Reverse Linked ListFront Middle Back Pointer | Easy | Solve | |
| Decode Ways1D DP | Medium | Solve | |
| Smallest Range Covering Elements from K ListsMerge K Sorted | Hard | Solve | |
| Populating Next Right Pointers in Each NodeTraversals | Medium | Solve | |
| Minimum Changes To Make Alternating Binary StringString Basics | Easy | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (9)
Beautiful Towers II · Maximum Length of Subarray With Positive Product · Cycle Length Queries in a Tree · Maximize the Confusion of an Exam · Number of People Aware of a Secret · House Robber IV · Minimum Swaps to Group All 1's Together II · Find the Count of Monotonic Pairs I · Maximum Sum Increasing Subsequence
Questions people ask
What coding questions does Arcesium ask most?
Partition Array Into Two Arrays to Minimize Sum Difference, Russian Doll Envelopes, Median of Two Sorted Arrays, Count Collisions on a Road, Find Median from Data Stream, Longest Consecutive Sequence, Sudoku Solver, Maximal Rectangle.
Which topics come up in Arcesium coding rounds?
dynamic programming, binary search, trees, graphs, heaps, sliding window.
How hard are Arcesium coding questions?
Of the reported questions, 2 are easy, 6 medium and 8 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.