← All problemsSign in

3951. Minimum Energy to Maintain Brightness

LeetCodeArraySortingOpen on judge ↗

You are given an integer n, representing n light bulbs arranged in a line and indexed from 0 to n - 1. You are also given an integer brightness and a 2D integer array intervals, where intervals[i] = [starti, endi] represents an inclusive time interval during which the lighting requirement must be satisfied. At each time unit, every bulb can independently be either on or off. A bulb that is on il

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

Sign in to chat with the tutor and save your progress.

Sign in to start