Find Building Where Alice and Bob Can Meet | Segment Tree Concepts & Qns | Video 11 | Leetcode 2940

[@Houstontex-as]

Thank you so much for your channel bro. I got my internship to amazon, paypal and many more in USA . I followed your channel and it help me alot yo build intuition and everything. Looking forward for more videos.

[@codestorywithMIK]

That is awesome! Congratulations, this means a lot to me. ❤️🙏

[@Houstontex-as]

@@codestorywithMIK thanks brother. Wish to see your channel grow more . Thank you so much for making my dream possible to work in silicon valley. I learn DP recursion everything from your channel and it helps me really well to explain in interview as well .

[@hyperme1831]

Are u from India? Had you applied to jobs from India? Can you please tell which portal you used for onsite jobs and how ?

[@Houstontex-as]

@@hyperme1831 No I am in USA as an international student

[@sam19001]

been waiting for this video for 2 days, thank you so much ✨

[@DebopriyoBasu]

Thanks for keeping the promise and solving problems for missed days❤

[@gui-codes]

MIK sir is on fire 🔥

[@jaisomnath1283]

Thanks bhaiya for that much hard work please make a similar type of series on the Fenwick tree and sparse table after completing this.

[@amankrishnarth6679]

Full power sir. Thanks a lot

[@Siddharthsirsate77]

After seeing the first 3 videos, this problem was quite enjoyable.❤

[@aws_handles]

Wow 😮😮 You are on fire 🔥

[@akashnaik5567]

1 Day : 5 Videos Mik is in on fire 🔥 Absolute GOAT 🐐 of DSA.

[@I_Love_You_Mansi_Forever]

best teacher i ever watched on youtube for DSA

[@rev_krakken70]

I solved this using stack and binary search. Wanted to see the segment tree approach. Thanks for sharing ❤

[@codestorywithMIK]

Glad it was helpful! Feel free to share the stack approach. It will help all of us to explore multiple approaches. ❤️🙏😇

[@swarupdwivedy5733]

Please make video on Time Complexity and Space Complexity.

[@deepbendudebnath9612]

Bhaiya ek playlist tree concept and question k bna dijiye please 🙏🏻 beginners k liye bhot helpful hoga

[@kasamahesh5958]

Bhaiyya i am from south india Can you please teach these Daily problems in english please. As i am unable to understand hindi.

[@floatingpoint7629]

implementing segment tree and solving this problem in 20 mins is very hard. i would use the stack approach instead

[@unknown47896]

same here

[@codestorywithMIK]

I totally agree. But yes, it’s a good approach to learn ❤️

[@vikashkansotiya2139]

Why don't we directly use upper bound in right side of max_index

[@codestorywithMIK]

upper_bound needs the array to be sorted. And our heights array need not be sorted always. You will have to write a custom upper_bound to mimic the binary search we wrote.

[@I_Love_You_Mansi_Forever]

4 din me apni teaching skill se apna fan bnade unhe mik sir kahte hain!!😂

[@I_Love_You_Mansi_Forever]

mik SIR AAJ KI PROBLEM TO BAHUT ASAN hai uske solution ki jagah previous sunday ki potd leetcode 2872: hard category ka solution de do please....