← Back to Arcesium

Array

16 questions

1Partition Array Into Two Arrays to Minimize Sum DifferenceHard
ArrayTwo PointersBinary Search
Solve →
2House Robber IVMedium
ArrayBinary SearchDynamic Programming
Solve →
3Find the Count of Monotonic Pairs IHard
ArrayMathDynamic Programming
Solve →
4Minimum Swaps to Group All 1's Together IIMedium
ArraySliding Window
Solve →
5Cycle Length Queries in a TreeHard
ArrayTreeBinary Tree
Solve →
6Maximum Length of Subarray With Positive ProductMedium
ArrayDynamic ProgrammingGreedy
Solve →
7Maximal RectangleHard
ArrayDynamic ProgrammingStack
Solve →
8Median of Two Sorted ArraysHard
ArrayBinary SearchDivide and Conquer
Solve →
9Maximum Length of Subarray With Positive ProductMedium
ArrayDynamic ProgrammingGreedy
Solve →
10Partition Array Into Two Arrays to Minimize Sum DifferenceHard
ArrayTwo PointersBinary Search
Solve →
11Cycle Length Queries in a TreeHard
ArrayTreeBinary Tree
Solve →
12House Robber IVMedium
ArrayBinary SearchDynamic Programming
Solve →
13Find the Count of Monotonic Pairs IHard
ArrayMathDynamic Programming
Solve →
14Minimum Swaps to Group All 1's Together IIMedium
ArraySliding Window
Solve →
15Maximal RectangleHard
ArrayDynamic ProgrammingStack
Solve →
16Median of Two Sorted ArraysHard
ArrayBinary SearchDivide and Conquer
Solve →