Problem Statement Given a binary array nums , return the maximum number of consecutive 1's present in the array. Example Input: nums = [1,1,0,1,1,1] Output: 3 Explanation: The longest sequence of consecutive 1's is [1,1,1] Length = 3 Brute Force Intuition (Interview Explanation) For every index, if the element is 1 , start moving forward and count how many consecutive 1's exist. Keep updating the maximum length found so far. Since for every position we may scan ahead again, many elements get vis