Minimum Size Subarray Sum (LeetCode 209) | Full solution with animations | Variable Sliding Window

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


Chapters:
00:00 - Intro
00:51 - Problem Statement
03:07 - Brute Force Approach
05:05 - Sliding window with 2 pointers
12:18 - Dry-run of Code
16:16 - Final Thoughts

📚 Links to topics I talk about in the video:

📖 Reference Books:

🎥 My Recording Gear:

💻 Get Social 💻

#leetcode #programming #interview
  1. Nikhil Lohia
  2. programming
  3. tutorial
  4. education
  5. algorithm
  6. logic
Рекомендации по теме
Minimum Size Subarray 0:12:30

Minimum Size Subarray Sum - Leetcode 209 - Python

Minimum Size Subarray 0:17:23

Minimum Size Subarray Sum (LeetCode 209) | Full solution with animations | Variable Sliding Window

Minimum Size Subarray 0:06:37

Minimum Size Subarray Sum - Leetcode 209 - Sliding Window (Python)

LeetCode Minimum Size 0:08:36

LeetCode Minimum Size Subarray Sum Solution Explained - Java

LeetCode 209 - 0:07:10

LeetCode 209 - Minimum Size Subarray Sum

Minimum Size Subarray 0:10:06

Minimum Size Subarray Sum | Leetcode - 209

Minimum Size Subarray 0:22:10

Minimum Size Subarray Sum | Leetcode #209

Minimum Size Subarray 0:05:30

Minimum Size Subarray Sum - LeetCode 209 - Coding Interview Questions

209. Minimum Size 0:11:27

209. Minimum Size Subarray Sum - Day 6/31 Leetcode July Challenge

Minimum Size Subarray 0:18:40

Minimum Size Subarray Sum | Google | Amazon | Easy Explanation | codestorywithMIK

Minimum Size Subarray 0:12:09

Minimum Size Subarray Sum - 209. LeetCode - C#

Leetcode 209 - 0:08:58

Leetcode 209 - Minimum Size Subarray Sum (JAVA Solution Explained!)

Minimum Size Subarray 0:09:43

Minimum Size Subarray Sum - LeetCode 209 - Python

Leetcode problem: Minimum 0:09:49

Leetcode problem: Minimum Size Subarray Sum - Javascript

Minimum Size Subarray 0:09:46

Minimum Size Subarray Sum #leetcode #topinterview150

LeetCode 209. Minimum 0:12:30

LeetCode 209. Minimum Size Subarray Sum

Minimum Size Subarray 0:32:12

Minimum Size Subarray Sum | Two Pointers | Leetcode 209

209. Minimum Size 0:09:43

209. Minimum Size Subarray Sum | LEETCODE MEDIUM | SLIDING WINDOW

Minimum Size Subarray 0:13:51

Minimum Size Subarray Sum || Leetcode 209 || Sliding Window || PythonXpert || LeetCode Problems

Leetcode | 209. 0:09:41

Leetcode | 209. Minimum Size Subarray Sum | Medium | Java Solution

Minimum Size Subarray 0:15:37

Minimum Size Subarray Sum Leetcode in Telugu | DSA in Python

L9. Sum of 0:23:35

L9. Sum of Subarray Minimum | Stack and Queue Playlist

LeetCode 209. Minimum 0:09:39

LeetCode 209. Minimum Size Subarray Sum || Java Solution Walkthrough

Leetcode 209 Minimum 0:07:37

Leetcode 209 Minimum Size Subarray Sum

Комментарии
Автор

thankyou so much sir, wonderful explanation, understood each and every thing perfectly !!

ananyieie
Автор

Got it in one go. Very nice explaination sir ❤

prashantraj
Автор

Sir... please drop a recursion playlist. I find it very confusing. The way you teach is very crisp and clear with all the illustrations.

hajeeramohamad
Автор

I make my self change to understand (solve problem) all video of this channel

Kuldeepa
Автор

why did we add while loop inside instead of if loop ?

Sivashankar_K
Автор

What is the time complexity of this solution ?

nandhakumarkr
Автор

if we are considering continuous sub arrays, then why can't we use prefix sum instead?
this is my code

int minSubArrayLen(int target, vector<int>& nums) {
int sum=0;
for(int i=0;i<nums.size();i++){
if(nums[i]==target)
return 1;
sum+=nums[i];
nums[i]=sum;
}
int count=0;
for(int i=nums.size()-1;i>=0;i--){
if(sum-nums[i]==target){
return count;
}
count++;
}
if(sum==target){
return count;
}
return 0;
}

but giving wrong answer for array [1, 2, 3, 4, 5], whose sum equal 11.

luson_
Автор

From some of past day i found you and really impressed with you, and want to know more about you sir and connect with you in LinkedIn could we??

angelbroker