BOXES
CodeChefOpen on judge ↗
Vijay is playing with set of boxes, each box is printed with a number on it. All the boxes placed in a row. You are given the numbers printed on the boxes in the row. Your task is to find the maximum sum of the numbers when one box is removed from the sub-set of boxes, and the sub-set is selected as a contiguous set of boxes from the row. Note: The sub-set should not be empty after removal
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.
Sign in to chat with the tutor and save your progress.
Sign in to start