Leetcode - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

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

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

Комментарии

5:16 you mean greater than one, anyway great explanation!

aishwat

Amazing solution. I learned something new. Thank you Sir 😄

I know "sliding window" plus a "Hash" and a " counter" can be used to find longest subarray with k distinct elements

Now you taught me that sliding window plus "min" and "max" deque can be used to find longest window with absolute difference less than k

alexnice

I love that min and max queue technique with the sliding window.

Also that deque technique is also used when finding the max or min value in each subarray of size K in an array O(n) time

alexnice

Why time complexity of deletion considered to be O(1) for deleting multiple elements from the deques. What if there are N elements to removed from the deque?

AnshMehtaGR

Can we use set we insert into set begin () will give smallest and end()-1 will give maximum

dailymemes

No logical flow of thought process. Deques just pop up out of nowhere. Where is the recurrence relation?

Siddharthpratapsingh

Awesome explanation. Make more videos like this

DiaryOfMuhib

What will your algorithm output for this input [10, 1, 2, 1, 7, 2] for k=5
It will be 4, which is wrong.

dhanushr

so sliding window kind of approach basically

code

in the first explanation, if we take input [4, 8, 5, 1, 7, 9] ur output is 6 but excepted is 3. u r comparing only with min and max elements.

akhilkumaramarneni

thanks for the solution. really good explanation.

ShwetaSingh-ypok

This question was asked in Facebook screening round

testbot

Hye bro. Good video. Enjoyed it. Pls keep making more such videos.

yuganderkrishansingh

bhaiya what if we use stack for min and max element

yashgupta-fkzc

we can actually use two variables for min and max

pvchio

Leetcode - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Longest Continuous Subarray with Absolute Diff Less than or Equal to Limit - Leetcode 1438 - Python

Leetcode - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Maximum Subarray - Kadane's Algorithm -- Leetcode 53

Continuous Subarray Sum - Leetcode 523 - Python

LeetCode 1438 | Longest Continuous Subarray With Absolute Diff ≤ Limit | ArrayDeque | Debug | Java...

Maximum Subarray - Amazon Coding Interview Question - Leetcode 53 - Python

Leetcode 128 - LONGEST CONSECUTIVE SEQUENCE

1438. Longest Continuous Subarray With Absolute Diff Less Than.. - Day 23/30 Leetcode June Challenge

LeetCode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Leetcode 1438 (Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit)

LeetCode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Leetcode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit #leetcode

Subarray Sum Equals K - Prefix Sums - Leetcode 560 - Python

Contiguous Array - Leetcode 525 - Python

LeetCode 1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit - Java

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

4. Sliding Window | Leetcode | 674 | Longest Continuous Increasing Subsequence

Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Leetcode 1438

1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | 3 Approaches

LeetCode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit - TS &...

Leetcode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit(mono q)

1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (Leetcode Medium)

Crack Your Next Coding Interview LeetCode 2760. Longest Even Odd Subarray With Threshold