Question 1

Maximum Length of Subarray With Positive Product — Arcesium Interview Question

Accepted Answer

"Maximum Length of Subarray With Positive Product" is a medium difficulty problem asked at Arcesium interviews. It covers the following topics: Array, Dynamic Programming, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product

Question 2

Cycle Length Queries in a Tree — Arcesium Interview Question

Accepted Answer

"Cycle Length Queries in a Tree" is a hard difficulty problem asked at Arcesium interviews. It covers the following topics: Array, Tree, Binary Tree. You can practice it on LeetCode: https://leetcode.com/problems/cycle-length-queries-in-a-tree

Question 3

Count Collisions on a Road — Arcesium Interview Question

Accepted Answer

"Count Collisions on a Road" is a medium difficulty problem asked at Arcesium interviews. It covers the following topics: String, Stack, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/count-collisions-on-a-road

Question 4

Maximize the Confusion of an Exam — Arcesium Interview Question

Accepted Answer

"Maximize the Confusion of an Exam" is a medium difficulty problem asked at Arcesium interviews. It covers the following topics: String, Binary Search, Sliding Window, Prefix Sum. You can practice it on LeetCode: https://leetcode.com/problems/maximize-the-confusion-of-an-exam

Question 5

Number of People Aware of a Secret — Arcesium Interview Question

Accepted Answer

"Number of People Aware of a Secret" is a medium difficulty problem asked at Arcesium interviews. It covers the following topics: Dynamic Programming, Queue, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/number-of-people-aware-of-a-secret

Question 6

Partition Array Into Two Arrays to Minimize Sum Difference — Arcesium Interview Question

Accepted Answer

"Partition Array Into Two Arrays to Minimize Sum Difference" is a hard difficulty problem asked at Arcesium interviews. It covers the following topics: Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask. You can practice it on LeetCode: https://leetcode.com/problems/partition-array-into-two-arrays-to-minimize-sum-difference

#	Question Title	Difficulty	Frequency	Topics
1	Maximum Length of Subarray With Positive Product	MEDIUM	100.0	ArrayDynamic ProgrammingGreedy
2	Cycle Length Queries in a Tree	HARD	100.0	ArrayTreeBinary Tree
3	Count Collisions on a Road	MEDIUM	97.6	StringStackSimulation
4	Maximize the Confusion of an Exam	MEDIUM	97.6	StringBinary SearchSliding Window+1
5	Number of People Aware of a Secret	MEDIUM	97.6	Dynamic ProgrammingQueueSimulation
6	Partition Array Into Two Arrays to Minimize Sum Difference	HARD	95.0	ArrayTwo PointersBinary Search+4
7	House Robber	MEDIUM	80.5	ArrayDynamic Programming
8	Search in Rotated Sorted Array	MEDIUM	74.9	ArrayBinary Search
9	Possible Bipartition	MEDIUM	74.9	Depth-First SearchBreadth-First SearchUnion Find+1
10	Stone Game VI	MEDIUM	74.9	ArrayMathGreedy+3

Explore 450+ Companies

Companies

Arcesium

Want to see more?

Arcesium Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Arcesium

Want to see more?

Arcesium Interview Questions

Ai Assistant Kas