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

[@codestorywithMIK]

Correction - Video - 24

[@Polly10189]

You have a God gifted talent of intelligence and explaining it so simply. Than you so much🎉

[@prathmeshkakde3731]

True ,wish I had teacher like him earlier!!!!

[@ramandeepsingh8464]

Please don't stop posting video and if you have time then please do contest discussion also

[@manibhushankumarsingh5196]

00:07 Find the longest continuous subarray with an absolute difference less than or equal to a given limit 02:12 Finding the longest continuous subarray with absolute difference less than or equal to limit. 06:23 To validate a sub-array, find the difference between its maximum and minimum elements. 08:27 Identifying valid subarrays based on difference limit. 12:38 Using a heap can efficiently track the minimum element within the window. 14:43 Implementing window sliding technique for efficient computation 18:33 Analyzing subarrays based on element limits 20:47 Algorithm for finding longest continuous subarray with absolute difference less than or equal to limit 24:13 Dry runs help in gaining clarity for solving problems. 25:59 Understanding the shifting of elements in the max and min heaps during traversal. 29:41 Finding valid subarrays with absolute difference less than limit. 31:40 Iterating through the array and checking limits for valid subarrays 35:40 Algorithm for finding longest continuous subarray with absolute difference less than or equal to limit 38:07 Discussed time complexity and approach for a sliding window problem 41:58 Efficient data structure for finding maximum and minimum elements with a given limit 43:50 Explanation of using Multi Set in C++ for efficient operations 47:20 Explanation of using max heap and multi set for inserting and removing elements.

[@michaelmaahi7384]

Thank you bhai

[@kaustubhchaudhari9838]

God Gifted Mic Bhai, Thank you for Explaining so easily

[@StackUnderFlow8055]

today i did the first question with a multiset , amazing explanation ❤❤

[@pavittarkumarazad3259]

Thanks, approach 2 was really amazing. I was able to solve it on my own with the 1st approach but what was more amazing was that you showed us why we need a TreeMap data structure while building the intuition.

[@ShardulPrabhu]

Thanks sir ❤ only question explain kr k pause krne bataya uske liye mere 😢 you care for us 😢😢 thank you so much

[@anjanasahay2172]

Yes Please Contest problems too...the hard and medium ones❤❤

[@saminaabbas9722]

Thank you MIK! You're the best

[@manishdubey4772]

@codestorywithMIK Hi sir, you discuss the 2nd approach which is using the TreeMap but there also arises one problem i.e if we have all unique elements then we have to traverse through all the elements of the map as I think there is no any way to get the smallest and largest element directly in O(1) time complexity. Can you please discuss it? At last, I really like your explanation of the question problem like a story, I want to thank you for your great videos

[@thefinalfit]

Complete legend. Detailed each step

[@floatingpoint7629]

thanks for the multiple dry run

[@ashutoshpandey1639]

I have solved this prolem using multiset, I think multiset wala approach is more intuitive than using priority queue

[@user13443fg]

Nice you stopped writing topic name in video thumbnail. It is necessary to understand problem first and build Intuition. i hope you will not show topics in video thumbnail in your future videos as well :)

[@gauravbanerjee2898]

Thanks a lot bhaiya ❤❤ Bohot hi pyara explanation tha 🔥

[@rahulnegi4027]

Bhaiya pleas leetcode ke contest ke question ke solution bhi explain krdo please apki explanation boht badiya lagti h please..... waiting for the series where you will do contest problems

[@gui-codes]

I felt this was hard but man you explain so well.

[@Lakshya-f4l]

Thanks a lot sir!

[@ArpitDhimaan]

bro pls add time stamp in future videos. It , saves lot of time.

[@23cash86]

Great video as always

[@CodeMode9313]

Little correction !!!! TIme stamp 9:19 , a lil minute error , diff b/w max and min is 7 not 6

[@EB-ot8uu]

legit. thanks a lot legend

[@imPriyansh77]

Great Explanation Bhaiya!!! Thank you...

[@chitranshjain9714]

Please resume dp concept series

[@venkatarohitpotnuru38]

Bhaiya weekend aagya..partion dp concept videos

[@AnjuGupta-sz1uk]

Amazing Expalnation 😊

[@arjunprasad1071]

Great explaination! if its possible please make an explainer on the O(N) approach ie deque approach🙏🙏

[@tarunsingh2480]

great explanation man ...

[@animestuff144]

Awesome explanation sir

[@anshror2583]

Bhai aap please contest ki 3 and 4 problem discuss kara laro please bhai request h

[@Vinamrasharma0523]

Waiting for this ❤

[@DevOpskagyaan]

Amazing explanation man

[@surekhasonawane4045]

Solved using Multiset as we can get min/max in O(1) . and deletion in O(1) whenever window's absolute difference exceed limit

[@gui-codes]

bhai multiset jaise STLs ko kaha se parha ? Can you share any good resource.

[@jitesh_khurana]

@@gui-codes gfg se padhle bhai

[@jitesh_khurana]

int longestSubarray(vector& nums, int limit) { int ans = 1; int n = nums.size(); int i = 0; int j = 0; multiset st; while(j

[@study-yd6es]

Amazing Explainations!!😍

[@VedBrahmbhattBEE]

Awesome as always.

[@ashish3487]

sir make some more questions video on segment tree

[@chitranshjain9714]

amazing explanation

[@SanjeevKumar-xv5lw]

Why didn't we use two deques for maintaining min and Max of the window avoiding that extra log n term which comes with heap and multiset?

[@aizad786iqbal]

one doubt, pop should be O(1) right, as we just delete the top element.... the push is log(n) time correct ? please confirm...

[@cricketsureshlucky]

Thank you so much

[@abhinavnarang4369]

bhaiya segmenr tree ki playlist continue krdo,interview h

[@prakharTiwari-c8n]

@codestorywithMIK , Thanks for your so detailed video but how TreeMap store duplicate value ?

[@anishbishnoi29xD]

i think TreeSet does not store duplicate value but TreeMap can store

[@harshsingh7713]

Guru ji Longest Nice subarray pe solution bna do please

[@manpreetsaluja3691]

I do it with map and sliding window concept

[@cricketsureshlucky]

Sir my kind request please upload a video on today's contest 3rd question. It is quite difficult solving dp.

[@ramandeepsingh8464]

Exactly 💯

[@RitikRanjan-fn9me]

try to think something related to consecutive negative numbers and apply pick not pick conditions accordingly

[@cp65143]

+1

[@ManojKrVerma-vw4dx]

I could solve this by sliding window and multiset.

[@jitesh_khurana]

Preety Good Easy Solution with multiset and sliding window int longestSubarray(vector& nums, int limit) { int ans = 1; int n = nums.size(); int i = 0; int j = 0; multiset st; while(j

[@amar4429]

[1,5,6,7,8,10,6,5,6] limit:- 4 Answer = 5 can you explain this example please👃

[@pokeindia5361]

Bhaiya aapne bola tha weekend pe *longest valid parantheses* ka video daaloge... Please bhaiya ye important q h interview k liye

[@empvaibhav9799]

Solve "Leetcode : 239. Sliding Window Maximum" before attempting this.

[@aizad786iqbal]

i tried using in tree set in java..but it doesn't store duplicate elements..

[@harmansingh722]

Which notepad do you use?

[@ReshuSharma-jc7yu]

Sir mereko kaise pata chalega ki isme heap use hoga question main ki nhi

[@akashsaurabh9196]

Why st.erase(st. Find(nums[i])) why not st. Erase(nums[i])??

[@codestorywithMIK]

There are 3 variants of erase in multiset. 1) void erase (iterator position); 2) size_type erase (const value_type& val); 3) void erase (iterator first, iterator last); If you use 1st one, it will only delete the single element pointed by the iterator position. If you use 2nd one, it will delete all occurrences of that element from the multiset. We don’t want that here because we can have duplicate elements.

[@Innovision2023]

Bhaiya tumara linkedin id thetho i will mention u in my leetcode acheivements

[@codestorywithMIK]

Hey, That’s sweet of you ❤️ www.linkedin.com/in/mazhar-imam-khan-95a34ab3?

[@MayankRathore-qi7qv]

sir mujhe yeh max heap ur min heap wala question smghj nhi aaya

[@TUSHARKHANDELWAL-i8s]

this question must be marked hard

[@gui-codes]

sahi me yaar.

[@naive-fleek7420]

@@gui-codes nahi yarr multiset use krte ho toh bhot easy hai , easy medium hoga

[@anish.naruto]

Sir, one thing i want to point out that you always take elements sorted in heaps.. But that's not always true in heaps, only the top element can be surely claimed as min or max... And heap structure changes on addition or deletion of elements to maintain that top value condition... So it's not good to talk like this that the max element will be in bottommost position in minheap or something like that. Though, i understand you're just taking that way to explain it better way but people can have misconception about heaps by this. Correct me if I'm wrong.

[@ramandeepsingh8464]

❤

[@AbhishekAnand-u7u]

💥💥💥💥💥explain most optimized solution from leetcode solution section💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥💥

[@deepanshuverma6237]

rep++

[@naive-fleek7420]

o(n) wala approach nahi bataye aap?

[@varunkedia6729]

Question says - difference b/w any two elements Then why are we talking diff of largest and smallest?

[@gui-codes]

See 5:03 in the video bro. The question say difference b/w any two elements MUST not exceed limit. So, for any subarray, instead of checking diference b/w every possible 2 elements pair (if they are crossing limit or not), you can simply check if the difference between highest and lowest number in that subarray is

[@RahulJohn-sv8gz]

Can you make your video in english

[@ks-xh4fq]

50 mins for 1 qs explanation ??

[@AbhishekAnand-u7u]

please share your slides

[@ago7506]

day-23 of saying lord🫡

[@Engineering.Wallah]

TLE //int n=nums.size(),ans=0; //for(int i=0;i