Write a method that finds the longest sequence of consecutive zeros in a list of integers and returns the length of that sequence. A sequence is broken by any non-zero number.
Examples:
Input: numbers = [1, 0, 0, 0, 2, 0, 0, 4]
Output: 3
Explanation: The longest sequence has 3 zeros between 1 and 2
Input: numbers = [0, 0, 5, 0, 0, 0]
Output: 3
Explanation: There are two sequences of zeros - length 2 at start and length 3 at end. 3 is longest.
Apex Code Editor
Welcome to Lightning Challenge!
Create an Account
Sign up to track your progress, earn points, and compete with others. Your solutions will be saved automatically.
Create accountHow It Works
- • Write your solution in the code editor
- • Connect your Salesforce org to test
- • Submit to check if your solution passes
- • Use hints if you get stuck
Contest Alert
🏆 #CodeEveryDay May 2026
Contest runs May 1 - 31. Complete challenges to climb the leaderboard!
Only the 31 daily challenges shown during this contest count toward points. Earlier dailies don't carry over.