3 years ago I got job offer from Amazon because of this video, thanks Tushar.
@aviralagarwal5871
5 жыл бұрын
In which order did you start doing things for competitive prgramming?
@uneebagha4633
5 жыл бұрын
Hi Emin
@hawktomnia007
4 жыл бұрын
Amazon now asks such hard question?
@shanugarg8428
4 жыл бұрын
Hey all, if anyone C++ coder here, then do checkout : kzitem.info/news/bejne/rLB-z4yXqJGiZ44
@tusharchouhan9606
3 жыл бұрын
good bro i know i helped many
@AnkitSharma-dx5yy
3 жыл бұрын
I don't really know why people do not recommend this guy's videos. This is such a gem of a channel
@phychematogy9031
Жыл бұрын
bcz he explains complex topics and most the people keep sticking to the easier ones. But if anyone is learning complex things they already know him. TUSHAR OP🔥🔥🔥
@TheGamerGuy201
7 жыл бұрын
i love how you always explain the recursion as well with a well labeled table...makes things very easy.
@DenisG631
8 жыл бұрын
The BEST! I tried to understand the segment tree explanation from wiki and code forces but I just didn't get it. You made it so easy to understand!!! Thank you!
@amritjha2802
4 жыл бұрын
Amazingly explained!! Clearly, the best introductory video available on segment trees as per me. Thank you Sir!
@AlexandrBorschchev
Жыл бұрын
This guy is flawless in teaching!
@sammy-zo6sl
5 жыл бұрын
I have improved my coding a lot from your videos. Keep up the great work
@jahirulislammonir3490
8 жыл бұрын
My heartiest thanks to you man,,, Your recursion explanation is one of the finest part of this video... Carry on :)
@shashankrajholavanalli2868
7 жыл бұрын
Awesome job. Very well done. Never seen a recursive function explanation so precise.
@nvjrane
8 ай бұрын
I used to think segment trees is some abstract concept. You have made it so easy. Thanks a ton!
@S4EProductions
7 жыл бұрын
Many thanks for this, great and easy to understand explanation, and everything was very well-made, including subtitles and everything else. Thank you for helping us, expecting nothing in return. Cheers
@pranavganorkar2379
9 жыл бұрын
Best video in KZitem on Segment Tree...Understood it Perfectly...!!! Many thanks.....
@anhadsingh4609
8 жыл бұрын
+Pranav Ganorkar Very true.
@EalhamAlMusabbir
8 жыл бұрын
+Pranav Ganorkar Yes... best video in KZitem on Segment Tree.... :) And thanks a lot for ur effort , sir...
@anyu8109
8 жыл бұрын
You got a talent of teaching. I have watched your video for kmp and segment tree, and you explained so clearly and so easy to understand.
@meganlee5897
6 жыл бұрын
Several interesting points related to segment tree worth chewing 1) how to calculate a ceiling number of power of 2. 2) why exactly worst case is 4 times lgn 3) how to do updates of the tree corresponding to update/append/deletion in original array
@briankarcher8338
2 жыл бұрын
I know it's 4 years late, but any update to a segment tree requires a recreation of the tree since the aggregates get changed up the tree. (which is O(n) time).
@roh9934
7 жыл бұрын
You are one of the best Teachers in the world of CS.Can easily take down Highly rated Professors.
@killerthoughts6150
Ай бұрын
the only man on the internet to nail this explanation
@iamdipankarj
9 жыл бұрын
Thank you! I was struggling with segment tree till now.
@bedapudisrinivas852
2 жыл бұрын
This video made 6 years ago and this video came first when i search about segment tree. Content matters
@priyanksingh6818
5 жыл бұрын
AMAZING!!! I was struggling how to implement trees on questions and you made it clear in single vedio.
@abhaypatil2000
4 жыл бұрын
tbh implementation for trees and segment trees are very different. Seg tree -> vector/array and tree -> class/ structure
@algorithmimplementer415
5 жыл бұрын
You are amazing! The way you built the tree and explained - just amazing!
@oshogarg5215
6 жыл бұрын
best explaination of segment tree on KZitem, we need people like you.
@vishalsheth1888
9 жыл бұрын
Best explanation! I will join the chorus to request a video on lazy propagation techniques.Lots of competitive programmers will appreciate it!
@nguyenhunginh8560
Жыл бұрын
there is a language barrier between me and him , but with a little help from gg translate , it is easy to understand the algorithms .I love this guy.
@vinayak_98
6 жыл бұрын
this is beyond the doubt...one of the most beautiful explanation for a segment tree..thanks!
@gauravjha6554
7 жыл бұрын
Best Video on Segment Tree....I understood the concept so clearly just because of you...Thanks you so much Sir
@ihatesaturn69420
3 ай бұрын
Kindest regards to you sir, I’ve been having much difficulty understanding this concept. Thank you so much!
@ashishdey9429
8 жыл бұрын
Excellent. Brilliant way of explaining recursion. You are the man dude (Y)
@avinashchaurasiya6497
2 жыл бұрын
Amazing video, clear to the point and the way you explain recursive calls is impressive. Thanks.
@apam5432
6 жыл бұрын
Hey there is an issue in the explanation, at 25:55, where u take value 4 from leaf, which should actually be 2. Other than that explanation was really great. Thanks for creating these videos
@yashagrawal6850
8 жыл бұрын
at 25:11 you said it wrong when there is complete overlap and we return segTree[pos] where pos=4 and value is 2 so returning value should be 2 but you said it 4 !! Let me know if i m wrong.
@shivamlakhwara5080
5 жыл бұрын
I think you're right ....I also caught that in the first place he returned an index instead of a value.
@mikenguyen91
2 жыл бұрын
nice catch, I tried to add a comment but you already did.
@a7medoka
8 жыл бұрын
You have no idea how happy i am after seeing this video someone explained this to me and i didn't understand a thing , but you really made it simple , thanks a lot . I guess I will be visiting your channel quite a lot :)
@SatyanarayanaBolenedi
7 жыл бұрын
Good one!! I like the way you explained, how to construction segmentTree with the help of tabulation. Tushar.. you are Awesome!!
@varuntanmay21
7 жыл бұрын
Awesome exposition of this interesting data structure. I think it could n't have been better. -> You explained motivation for this ds. -> Cost of creation in terms of time, space complexity. -> Detailed algo with illustrations. Your approach shows how well you understand this ds.
@karthikmucheli7930
5 жыл бұрын
I just had this observation. The 2D matrix to find the min in an array is the segment tree if you consider top right corner as the root node.
@naughtyrishan
9 жыл бұрын
Thanks a lot. Please keep uploading such videos. You help many. Your explanation along with the codes line by line really helps a lot in actual implementation. Thanks again.
@dmitrykoval5613
11 ай бұрын
great explanation, thanks a lot. the only thing I'd like to point out is the way the middle element is calculated. Instead, I would count it like this (high - low) / 2 + low
@codeeasy855
3 жыл бұрын
You have some really great videos Tushar. This is the best explanation from an implementation point of view. Thanks!
@adityak1511
8 жыл бұрын
Great explanation Tushar! You're helping a lot of people here... Keep up the good work!!
@prateeksoni2294
4 жыл бұрын
one easily see the effort behind this wonderful video. Thank You. Really helpful
@alok696969
3 жыл бұрын
Thanks a lot Tushar for creating these videos !!! Really helps in clearing out the concepts while preparing for interviews.
@ankishbansal420
5 жыл бұрын
Thanks tushar, you are legend in ds/algo. I struggle with this entire day, but you made my day. Thanks
@rajeevkumaryadav4046
7 жыл бұрын
that's the dought I had rest the videos you put on are too good and helpful.thank you
@AkshayAradhya
9 жыл бұрын
WOW Thank you so much.Your resources really help me better at programming competitions
@huawu8706
5 жыл бұрын
Thanks, Tushar, you always give us a very detailed explanation.
@realstory5818
Жыл бұрын
thanks bro realy helped me to prepare for olympics
@eavanshiarora887
8 жыл бұрын
Cannot get a better explanation! Thankyou :)
@uditkaushik
7 жыл бұрын
Sir your lectures are just amazing ,the way in which you explain things makes me feel BETTER :P . Sir I have a request please upload a video on maximum sub array problem using segment tree. I'll be highly obliged to you !! Thanks sir :) !!
@marwanalaa3962
9 жыл бұрын
It is very helpful and it is great to explain a recursive function till the end. thanks a lot :)
@Sushil2874
4 жыл бұрын
I mean this is the best explanation that i can get of this..!! Thank you so much for such great explanation..!!
@shivammittal704
5 жыл бұрын
Really recursion is damn powerful, very well explained sir!
@KrishnaKumar-yn9wf
3 жыл бұрын
But if used in production you get fired.
@anoohyabollampally9733
4 жыл бұрын
Excellent , understood in the very first go. Thanks.
@namanrastogi4501
4 жыл бұрын
nice work. keep doing such videos on competitive programming.
@Nerraruzi
8 жыл бұрын
Outstanding presentation, very clear and accessible!
@swetabjahazra8050
8 жыл бұрын
Best explanation, cant be any better..........
@SonuSonu-tk5pk
7 жыл бұрын
A unique way of explaining recursion. Great video.
@kaivanmehta5771
2 жыл бұрын
Amazing explanation, please cover updating a segment tree. Thanks!
@vishalyadav-fy7mv
6 жыл бұрын
Best explanation ever on segment tree
@AshishRawat-zl6te
8 жыл бұрын
awesome video..great way to explain recursion for creation....really helped a lot....thanx......
I scare to look into segment tree alg before watching this video . Thanks Tushar Roy
@parvezmulla3324
4 жыл бұрын
The Best I have ever seen about Segment Tree!
@prasadchaudhari1001
7 жыл бұрын
I think in the video, the segment tree should have been made on a array length which is not a power of two so that people can also understand how other elements that are not been used are also not effecting the segTree array
@georgiossamaras5063
4 жыл бұрын
Awesome and laconic introduction of Segment Trees, thanks!
@shobhitsrivastava4496
4 жыл бұрын
You are great, man may god bless you. your deserve a lot more subscribers!!
@ManishKumar-zt5sk
4 жыл бұрын
best explanation so far...
@ChristopherNemoNakamura
2 жыл бұрын
Aaaah it makes so much sense now! Thank you for this great explanation!
@balasahebdabhade3091
9 жыл бұрын
Thanks a lot sharing. Simple and best explaination of segment tree. It would be great if can share one video on Fenwick tree or binary indexed tree.
@GoodgameMaster
6 жыл бұрын
You're making the best tutorials! Thanks a lot!!
@dhiaeddinegharsallah2923
9 жыл бұрын
Thank you so much dude ! I was struggling to understand Segment Tree until I have found your video ! I ow you a lot man ! You're awesome (y) (y)
@sridevip.v.4243
2 жыл бұрын
Tushar thankyou😊😊😊you made the concept so easyyy
@pulkitgupta8575
6 жыл бұрын
tushar bhaiya ki jai ho jai ho ..... maza agaya
@suniladitya1016
4 жыл бұрын
your explanation is amazing
@Bala-go6cc
9 жыл бұрын
Video was awesome...but somewhat fast..It's great...bro..thank you..
@annafalvello8138
2 жыл бұрын
Your videos are so helpful, thank you!
@shikharsubedi4703
5 жыл бұрын
thank you so much for such a thorough explanation. You got a new subscriber
@derpfaceonigiri4950
7 жыл бұрын
You're awesome sir, this helped me a lot in segment tree self studying :'D
@thexwines
4 жыл бұрын
awesome way to explain recursion, thanks a lot sir
@TankNSSpank
3 жыл бұрын
Did this guy just came out of the movie "three idiots" lol Thanks for the video
@ZiadxKabakibi
9 жыл бұрын
Easy to understand ,simple code... Thank you very much ! :)
@AmanSingh-wb9ev
6 жыл бұрын
Nice video ..really helped me ..to write my first code in segment tree
@chinmayrakshit9872
9 жыл бұрын
thanks sir your explanation is simple and auwsum.....helps me a lot for competitive programming... :)
@mojahidislam9717
9 жыл бұрын
it was a great video..i was looking on d internet regarding segment tree but no one has explained it better than u particularly d way u explain your code....Sir,if u could put videos on other topics which r necessary for competitive coding as it is difficult to get those contents on internet.. please put videos on how to solve problems on greedy concepts and other algorithmic concepts if possible by taking some problems of spoj ...
@hypernarutouzumaki
7 жыл бұрын
Please post a video on Interval Tree ! Your videos helped me a lot !
@vidhansharma1787
6 жыл бұрын
best explanation of segment trees......
@arhankundu2516
4 жыл бұрын
Thank you sir for this awesome explanation 😃
@rajeshrao2008
8 жыл бұрын
Great explanation @tushar. How did you arrive at saying that the worst case space complexity to store this segment tree will be 4n?
@remusvalentin099
7 жыл бұрын
Thank you man, you are great at explaining stuff, keep em comming!!
@BipinOli90
7 жыл бұрын
Thanks for making this. You rock Tushar. You da man :)
@deb232
9 жыл бұрын
Sir, can you also explain 1. Suffix array 2. KMP 3. Flow problems 4. Maximum Bipartite matching You explain really well and they help me grasp the concepts. I ave been trying to wrap my head around these things for long!
@amritanshbaghel6386
8 жыл бұрын
this guy is absolutely amazing . thanks @tushar roy...
@shaileshpandey5697
9 жыл бұрын
I really appreciate your contribution in increasing our knowledge. Can you please upload video on TRIE.
@depengluan7222
8 жыл бұрын
Awesome explanation! Thanks, Tushar!
@ShounakKundu
2 жыл бұрын
Even before algoexpert and scalar existed, this guy was the ULTIMATE GOD of DSA. Too bad he did not continue his channel. It is a humongous loss for us all.
@ujjawalgupta5303
4 жыл бұрын
Thanks for this awesome explanation.
@soumyajitdutta428
7 жыл бұрын
Awesome way of explaining..Hats of and thanx
@thinhvu6902
3 жыл бұрын
Wow I love this tutorial, thank you so much!!!!
@nitskrishna
9 жыл бұрын
Great explanation Tushar, I am little confused on few things, it would be really helpful if you could help me out of my confusions. 1. Create Segment tree: How at max the size of the Segment tree will be 4 times N, N being the total elements in the provided array ? Suppose the elements are 5 so we will need 15 as the size of the Segment tree. 2. Search min in range : How in worst case it looks in 4 different directions ? For a given range we find if its Partial Overlap and then choose to either have a look at both the Nodes other wise we return (a very large number in case of No overlap or the value at node in case of Full overlap). Thanks
@visheshsharma4800
7 жыл бұрын
In an almost complete binary tree (segment tree is complete in most cases) total number of nodes are equal to twice of total leaf nodes -1 so this proves that whatever the array be since all the elements of array are leaves of segment tree we will get a O(n)space and time complexity because total number of nodes will be of order O(n) and yes if the elements are 5 there will be 15 which is o(n). 2. For your second doubt he explained that if there is partial we look at both nodes if complete we return value(as minimum) and if does not overlap we return max thats it. I guess i got your doubts correctly
@kaushalpranav
9 жыл бұрын
Thanks for this . Can you provide some thing on lazy propagation in segment tree as an extension for this , it will be really useful . Thanks in advance .
Пікірлер: 338