Hi Ayushi, thank you for the video. I have been following most of your lectures, you are explaining very well. Can you please make a video for Leetcode 308: Range Sum Query 2D - Mutable (the current question continuation problem.). I have worked the same method, I also tried doing prefix sum over matrix but time complexity is more. Looking forward to a solution for this problem
Best introduction on segment trees! Keep up the good work.
Thank you so much Amol. Means a lot😊
Best explanation on segment trees🤩
Thank you Om😊
Thanks alot ayushi
Welcome :) glad it was helpful
your voice is awesome😌
Thank you so much 😊
3 is less than 5 na so it should overlap completely plz check it at timestamp 13:19
Hi Ayushi, thank you for the video. I have been following most of your lectures, you are explaining very well. Can you please make a video for Leetcode 308: Range Sum Query 2D - Mutable (the current question continuation problem.). I have worked the same method, I also tried doing prefix sum over matrix but time complexity is more. Looking forward to a solution for this problem
Sure. 😊
Awesome!
Thanks Divyansh :)
at 7:50 that should be 7, 9 ❤❤
Mam there is a doubt in the sumRange function:
in the second if condition of the shouldn't it be (left
in sumrange func , how does this work?
left
Thankyou for great explanation.
Welcome 🤗
Amazingly taught! Thank you so much.
Welcome Prem :)
why we resize the seg. vector ??can you please explain
Mam, why did you resize vector to 4*n?
what's the rational behind taking the size of seg tree as 4*n?
@AyushiSharmaDSA pls explain it
thanks
Welcome Raushan :)
This should be a hard problem , not medium
What is ss se and left right
please try to improve your drawing explanation rest is good