Practice problems across 75+ categories
Practice problems frequently asked at Array • 1947 problems | 398 Easy | 1049 Medium | 497 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 1081 | Maximum Strength of K Disjoint Subarrays | Hard | ArrayDynamic ProgrammingPrefix Sum |
| 1082 | Maximum Strictly Increasing Cells in a Matrix | Hard | ArrayHash TableBinary Search |
| 1083 | Maximum Strong Pair XOR I | Easy | ArrayHash TableBit Manipulation |
| 1084 | Maximum Strong Pair XOR II | Hard | ArrayHash TableBit Manipulation |
| 1085 | Maximum Students on a Single Bench | Easy | ArrayHash Table |
| 1086 | Maximum Students Taking Exam | Hard | ArrayDynamic ProgrammingBit Manipulation |
| 1087 | Maximum Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
| 1088 | Maximum Subarray Min-Product | Medium | ArrayStackMonotonic Stack |
| 1089 | Maximum Subarray Sum After One Operation | Medium | ArrayDynamic Programming |
| 1090 | Maximum Subarray Sum With Length Divisible by K | Medium | ArrayHash TablePrefix Sum |
| 1091 | Maximum Subarray Sum with One Deletion | Medium | ArrayDynamic Programming |
| 1092 | Maximum Subarray With Equal Products | Easy | ArrayMathSliding Window |
| 1093 | Maximum Subsequence Score | Medium | ArrayGreedySorting |
| 1094 | Maximum Subtree of the Same Color | Medium | ArrayDynamic ProgrammingTree |
| 1095 | Maximum Sum Circular Subarray | Medium | ArrayDivide and ConquerDynamic Programming |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
