Problem database last updated: June 20, 2025
20 problems · 0 Easy, 14 Medium, 6 Hard · Ranked #95 of 458
0 Easy
0% · avg 23%
14 Medium
70% · avg 59%
6 Hard
30% · avg 18%
Based on 20 reported problems, Arcesium interviews are significantly harder than average - 30% Hard vs 18% across all companies. The majority (70%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Arcesium puts unusual emphasis on union-find (10% of problems, 3.4x the industry average), prefix-sum (10% of problems, 3x the industry average), dynamic-programming (50% of problems, 2.5x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (60%), dynamic-programming (50%), string (20%), binary-search (15%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Length of Subarray With Positive Product Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive. | Medium | Very Likely | arraydynamic-programminggreedy | Solve |
Cycle Length Queries in a Tree You are given an integer n. There is a complete binary tree with 2n - 1 nodes. The root of that tree is the node with the value 1, and every node with a value v... | Hard | Very Likely | arraytreebinary-tree | Solve |
Number of People Aware of a Secret On day 1, one person discovers a secret. | Medium | Very Likely | dynamic-programmingqueuesimulation | Solve |
Maximize the Confusion of an Exam A teacher is writing a test with n true/false questions, with 'T' denoting true and 'F' denoting false. He wants to confuse the students by maximizing the numbe... | Medium | Very Likely | stringbinary-searchsliding-window | Solve |
Count Collisions on a Road There are n cars on an infinitely long road. The cars are numbered from 0 to n - 1 from left to right and each car is present at a unique point. | Medium | Very Likely | stringstacksimulation | Solve |
Partition Array Into Two Arrays to Minimize Sum Difference You are given an integer array nums of 2 n integers. You need to partition nums into two arrays of length n to minimize the absolute difference of the sums of t... | Hard | Very Likely | arraytwo-pointersbinary-search | Solve |
House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob... | Medium | Very Likely | arraydynamic-programming | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Likely | arraybinary-search | Solve |
Possible Bipartition We want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some other people, and they should not go into t... | Medium | Likely | depth-first-searchbreadth-first-searchunion-find | Solve |
Stone Game VI Alice and Bob take turns playing a game, with Alice starting first. | Medium | Likely | arraymathgreedy | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Likely | arraytwo-pointers | Solve |
Binary Tree Maximum Path Sum A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ... | Hard | Likely | dynamic-programmingtreedepth-first-search | Solve |
Find The Count Of Monotonic Pairs I You are given an array of positive integers nums of length n. A pair of non-negative integer arrays (arr1, arr2) is called monotonic if both arrays have length... | Hard | Likely | arraymathdynamic-programming | Solve |
Best Time to Buy and Sell Stock IV You are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k. | Hard | Likely | arraydynamic-programming | Solve |
Surrounded Regions You are given an m x n matrix board containing letters 'X' and 'O', capture regions that are surrounded: | Medium | Likely | arraydepth-first-searchbreadth-first-search | Solve |
Minimum Insertion Steps to Make a String Palindrome Given a string s. In one step you can insert any character at any index of the string. | Hard | Likely | stringdynamic-programming | Solve |
Maximum Product Subarray Given an integer array nums, find a subarray that has the largest product, and return the product. | Medium | Likely | arraydynamic-programming | Solve |
Sort Colors Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order... | Medium | Likely | arraytwo-pointerssorting | Solve |
Pow(x, n) Implement pow(x, n), which calculates x raised to the power n (i.e., xn). | Medium | Likely | mathrecursion | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Likely | stringdynamic-programming | Solve |
Maximum Length of Subarray With Positive Product
SolveGiven an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.
Cycle Length Queries in a Tree
SolveYou are given an integer n. There is a complete binary tree with 2n - 1 nodes. The root of that tree is the node with the value 1, and every node with a value v...
Number of People Aware of a Secret
SolveOn day 1, one person discovers a secret.
Maximize the Confusion of an Exam
SolveA teacher is writing a test with n true/false questions, with 'T' denoting true and 'F' denoting false. He wants to confuse the students by maximizing the numbe...
Count Collisions on a Road
SolveThere are n cars on an infinitely long road. The cars are numbered from 0 to n - 1 from left to right and each car is present at a unique point.
Partition Array Into Two Arrays to Minimize Sum Difference
SolveYou are given an integer array nums of 2 n integers. You need to partition nums into two arrays of length n to minimize the absolute difference of the sums of t...
House Robber
SolveYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Possible Bipartition
SolveWe want to split a group of n people (labeled from 1 to n) into two groups of any size. Each person may dislike some other people, and they should not go into t...
Stone Game VI
SolveAlice and Bob take turns playing a game, with Alice starting first.
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Binary Tree Maximum Path Sum
SolveA path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequ...
Find The Count Of Monotonic Pairs I
SolveYou are given an array of positive integers nums of length n. A pair of non-negative integer arrays (arr1, arr2) is called monotonic if both arrays have length...
Best Time to Buy and Sell Stock IV
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day, and an integer k.
Surrounded Regions
SolveYou are given an m x n matrix board containing letters 'X' and 'O', capture regions that are surrounded:
Minimum Insertion Steps to Make a String Palindrome
SolveGiven a string s. In one step you can insert any character at any index of the string.
Maximum Product Subarray
SolveGiven an integer array nums, find a subarray that has the largest product, and return the product.
Sort Colors
SolveGiven an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
Pow(x, n)
SolveImplement pow(x, n), which calculates x raised to the power n (i.e., xn).
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Arcesium interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Arcesium interviews focus heavily on array, dynamic-programming, string problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Arcesium interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Arcesium has been reported to ask 20 distinct coding problems. The most common topics are array, dynamic-programming, string. 0 are Easy difficulty, 14 are Medium, and 6 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 20 reported problems, Arcesium interviews are significantly harder than average - 30% Hard vs 18% across all companies. 70% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, string. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Arcesium coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Arcesium interview with AIarrow_forward
