Leetcode problem 112 - Max Consecutive Ones III
Given a binary array nums and an integer k, return the maximum number of consecutive 1’s in the array if you can flip at most k 0’s.
Jonghan's learning path
Today I Learned as a developer
Recent posts
Leetcode problem 111 - Count Complete Subarrays in an Array
You are given an array nums consisting of positive integers.
Leetcode problem 110 - Count Number of Nice Subarrays
Given an array of integers nums and an integer k. A continuous subarray is called nice if there are k odd numbers on it.
Leetcode problem 109 - Number of Substrings Containing All Three Characters
AGiven a string s consisting only of characters a, b and c.
Leetcode problem 108 - Maximize the Confusion of an Exam
A teacher is writing a test with n true/false questions, with ‘T’ denoting true and ‘F’ denoting false. He wants to confuse the students by maximizing the nu...