← Back to Bny Mellon

Array

28 questions

1Minimize Malware SpreadHard
ArrayHash TableDepth-First Search
Solve →
2Car FleetMedium
ArrayStackSorting
Solve →
3Bitwise ORs of SubarraysMedium
ArrayDynamic ProgrammingBit Manipulation
Solve →
4Kth Largest Element in an ArrayMedium
ArrayDivide and ConquerSorting
Solve →
5Group AnagramsMedium
ArrayHash TableString
Solve →
6Sum of DistancesMedium
ArrayHash TablePrefix Sum
Solve →
7Minimize Length of Array Using OperationsMedium
ArrayMathGreedy
Solve →
8Maximum Area of a Piece of Cake After Horizontal and Vertical CutsMedium
ArrayGreedySorting
Solve →
9Find the Count of Monotonic Pairs IIHard
ArrayMathDynamic Programming
Solve →
103SumMedium
ArrayTwo PointersSorting
Solve →
11Count Number of Maximum Bitwise-OR SubsetsMedium
ArrayBacktrackingBit Manipulation
Solve →
12Best Time to Buy and Sell StockEasy
ArrayDynamic Programming
Solve →
13Merge Sorted ArrayEasy
ArrayTwo PointersSorting
Solve →
14Count Good SubarraysHard
ArrayStackBit Manipulation
Solve →
15Maximum Area of a Piece of Cake After Horizontal and Vertical CutsMedium
ArrayGreedySorting
Solve →
16Sum of DistancesMedium
ArrayHash TablePrefix Sum
Solve →
17Minimize Length of Array Using OperationsMedium
ArrayMathGreedy
Solve →
18Minimize Malware SpreadHard
ArrayHash TableDepth-First Search
Solve →
19Car FleetMedium
ArrayStackSorting
Solve →
20Bitwise ORs of SubarraysMedium
ArrayDynamic ProgrammingBit Manipulation
Solve →
21Kth Largest Element in an ArrayMedium
ArrayDivide and ConquerSorting
Solve →
22Group AnagramsMedium
ArrayHash TableString
Solve →
23Find the Count of Monotonic Pairs IIHard
ArrayMathDynamic Programming
Solve →
243SumMedium
ArrayTwo PointersSorting
Solve →
25Count Number of Maximum Bitwise-OR SubsetsMedium
ArrayBacktrackingBit Manipulation
Solve →
26Merge Sorted ArrayEasy
ArrayTwo PointersSorting
Solve →
27Best Time to Buy and Sell StockEasy
ArrayDynamic Programming
Solve →
28Count Good SubarraysHard
ArrayStackBit Manipulation
Solve →