MEXXX

CodeChefOpen on judge ↗

Everyone knows the definition of MEX, including Jamshed. But Jamshed loves MEX, so he comes up with a new problem involving MEX every day, including today. Given an array of size n. You can partition the array into any number of contiguous subarrays. You need to find the maximum sum which is obtained by adding the MEX of each partitioned subarray. Each element of the given array belongs to exact

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI