Maximum Consecutive Ones - 1 (Leetcode Medium) | Hashmap Interview Questions
Автор: Pepcoding
Загружено: 2020-10-12
Просмотров: 21357
Описание:
Please consume this content on nados.pepcoding.com for a richer experience. It is necessary to solve the questions while watching videos, nados.pepcoding.com enables that.
NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. In this video, we discuss the problem Maximum Consecutive Ones with K flips using hashmaps in java. In this problem,
1. You are given an array(arr) which contains only 0's and 1's and a number K.
2. You have to find the maximum number of consecutive 1's in the given array if you can flip at most K zeroes.
To attempt the submit this question, click here: https://www.pepcoding.com/resources/d...
For a better experience and more exercises, VISIT:
Have a look at our result:
Follow us on our FB page: / pepcoding
Follow us on Instagram: / pepcoding
Follow us on LinkedIn: / pepcoding-education
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
