{"id":914,"date":"2025-08-20T12:39:55","date_gmt":"2025-08-20T07:09:55","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=914"},"modified":"2025-08-20T12:39:56","modified_gmt":"2025-08-20T07:09:56","slug":"max-consecutive-ones-iii","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/max-consecutive-ones-iii\/","title":{"rendered":"Max Consecutive Ones III | Leetcode 1004 | Fixed Window Solution"},"content":{"rendered":"\n

The problem\u00a0\u201cMax Consecutive Ones III\u201d<\/strong>\u00a0asks for the\u00a0length of the\u00a0longest subarray containing\u00a0only\u00a01s<\/strong>\u00a0after\u00a0flipping at most\u00a0k zeros<\/strong>\u00a0to\u00a01s. This is a\u00a0classic\u00a0sliding window<\/strong>\u00a0problem where\u00a0we maintain a\u00a0window with at\u00a0most\u00a0k zeros<\/strong>.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

\n\n\n\n

Given a binary array nums<\/code> and an integer k<\/code>, return the maximum number of consecutive <\/em>1<\/code>‘s in the array if you can flip at most<\/em> k<\/code> 0<\/code>‘s.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> nums = [1,1,1,0,0,0,1,1,1,1,0], k = 2\nOutput:<\/strong> 6\nExplanation:<\/strong> [1,1,1,0,0,1<\/strong>,1,1,1,1,1<\/strong>]\nBolded numbers were flipped from 0 to 1. The longest subarray is underlined.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> nums = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], k = 3
Output:<\/strong> 10
Explanation:<\/strong> [0,0,1,1,1<\/strong>,1<\/strong>,1,1,1,1<\/strong>,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1. The longest subarray is underlined.<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n