Variable Size Sliding Window | Largest Subarray of sum K | Part1
[FREE] Beginners lessons in programming by Codechef - https://www.unacademy.com/a/beginner-...
Patreon Link: / adityaverma
Video Pdf Notes And Code: / 44434748
Playlist Link: • Sliding Window Algorithm | Face to Fa...
Problem Description:
Given an array containing N positive integers and an integer K. Your task is to find the length of the longest Sub-Array with sum of the elements equal to the given value K.
For Input:
1
7 5
4 1 1 1 2 3 5
your output is:
4 .
------------------------------------------------------------------------------------------
Here are some of the gears that I use almost everyday:
🖊️ : My Pen (Used in videos too): https://amzn.to/38fKSM1
👨🏻💻 : My Apple Macbook pro: https://amzn.to/3w8iZh6
💻 : My gaming laptop: https://amzn.to/3yjcn23
📱 : My Ipad: https://amzn.to/39yEMGS
✏️ : My Apple Pencil: https://amzn.to/3kMnKYf
🎧 : My Headphones: https://amzn.to/3kMOzM7
💺 : My Chair: https://amzn.to/385weqR
🛋 : My Table: https://amzn.to/3kMohtd
⏰ : My Clock: https://amzn.to/3slFUV3
🙋🏻♀️ : My girlfriend: https://amzn.to/3M6zLDK ¯\_(ツ)_/¯
PS: While having good gears help you perform efficiently, don’t get under the impression that they will make you successful without any hard work.
Watch video Variable Size Sliding Window | Largest Subarray of sum K | Part1 online without registration, duration hours minute second in high quality. This video was added by user Aditya Verma 29 November 2020, don't forget to share it with your friends and acquaintances, it has been viewed on our site 154,369 once and liked it 3.5 thousand people.