The Sliding Window Algorithm Explained - Max Consecutive Ones III - Leetcode 1004 - Python

Показать описание

FAANG Coding Interviews / Data Structures and Algorithms / Leetcode

Рекомендации по теме

Комментарии

Thank you for watching the video! You can find a long-form explanation to this problem in the related video section (bottom left corner of the screen). Subscribe if you want to see these in your feed daily!

GregHogg

Dude getting jacked from bench pressing all these algorithms

dukeray

programmers after thousand leetcode questions for real

creatively

This question wasn't too tough, but I could not for the life of me figure out the logic behind contracting the window until it became valid. Your vid saved me lol

eric

We're gonna need that workout routine greg😂😂

ForexPeak

We can replace While() with simple if() by these the time complexity from O(n+n) to O(n). By replacing with if we are resisting the window from decreasing it size from the current maximum size.

prathamgolwala

Damn, he's jacked

time.sleep() build

Harmxn

Just solved this yesterday and now this video comes in my feed

Om-idqr

Master Data Structures & Algorithms For FREE at AlgoMap.io!

GregHogg

When you're bench pressing the window instead of sliding the window.

MagnumCarta

Can we use prefix sum to solve this? Compute the consecutive 1s and 0s then loop through it using sliding window

nagisa

Woah, you’re actually pretty jacked and beefy okay then

servantofthelord

i'm still a beginner at python. my version of sliding window was similar but a little different than yours. I got a time of 408ms on leetcode but it says 16% of submissions got better performance times. What can be done with either the python language or the algorithm to speed this up?

mazthespaz

O(n) i dont get it there are 2 loops, sure there is a condition for while but when it's true it would take O(n^2) right?

anas.aldadi

for some reason my idea was keep a current max, and a total max, every time the number is 1 the count gets added to the current max, and then when it’s 0 it’s reset. Then throughout the whole way, the total max is the peak of the current max.

DreadTeamLeader

The Sliding Window Algorithm Explained - Max Consecutive Ones III - Leetcode 1004 - Python

Sliding window technique - Inside code

Sliding Window Technique - Algorithmic Mental Models

Sliding Window Technique

Sliding Window Algorithm Explained Clearly | Longest Substring Without Repeating Characters Leetcode

Sliding Window Technique + 4 Questions - Algorithms

The Sliding Window Algorithm Explained - Max Consecutive Ones III - Leetcode 1004 - Python

Sliding Window Algorithm - Variable Length + Fixed Length - DSA Course in Python Lecture 13

Sliding window algorithm | Javascript

Introducing Sliding Window Technique [Sliding Window Technique]

Sliding Window Algorithms are Extremely Common!! | Max Consecutive Ones III - Leetcode 1004

Maximum Average Subarray (LeetCode 643) | Sliding Window Algorithm | Full solution with animations

The Ultimate Sliding Window Algorithm Explanation

Sliding Window Algorithm - Longest Substring Without Repeating Characters (LeetCode)

I gave 127 interviews. Top 5 Algorithms they asked me.

Hashing - Sliding Window Technique | C++ Placement Course

sliding window algorithm in python with example

Sliding Window Maximum - Monotonic Queue - Leetcode 239

Sliding Window Approach | Longest Continuous Increasing Subsequence | LeetCode 674.

Lec-12: Sliding Window 🪟 Technique | Data Structure

LeetCode was HARD until I Learned these 15 Patterns

L1. Introduction to Sliding Window and 2 Pointers | Templates | Patterns

Sliding Window Object Detection | Deep Learning Tutorial 30 (Tensorflow, Keras & Python)

Cracking Common Interview Algorithm Patterns: Sliding Window Part 1 of 3

Window Sliding Technique | Why? What? When? How? | Comparison, Code Identification of Questions