@@AshwaniYadavIIT Thanks for an interesting suggestion! It's only been 20 years since I did anything with Fast Fourier transform =) I am adding it to my list. Cheers!
@@stablesort It would be great if you could explain an algorithm to settle that account among n number of friends, given an array indicating the amount each person will receive (+) or has to give (-) to settle the account. I am not aware of any greedy algorithms to solve this
Thanks for the encouragement, Renjie! Sometimes I do think that I am putting way too much time into these videos. But reading your comments feels like an adrenaline shot that keeps me going =)
Your huge amount of effort that you put into these beautifully concise and crystal clear videos pays off by saving valuable time of thousands of students that learn from these super well made videos far greater than any other videos on UA-cam!! I hope this gem of a channel never stops producing such high quality content.
You are a fantastic educator. If you've ever watched competitive programming streams where they explain the answers you'll know being good at something and being able to explain something are two very different things. You have done the community quite a service in bringing such clear explanations!
Thank you, that's a very nice compliment, I do appreciate it. I'll do my best to keep it up. By the way, after publishing each video, I start looking for a new topic to cover. So if you have any suggestions, please do let me know. Thanks!
Your videos are some of the best on UA-cam. Incredibly clear and such interesting algorithms. I love how you explain the simple version of an algorithm before explaining the final version, makes things so clear!
There’s so many videos on computer algorithms on the internet these days, but hardly any could match up to the caliber of your videos. I am not sure how you manage to make these high-quality videos continuously but I am very thankful you do and kudos to you from Taiwan!
Every second of this 9 mins video is worth watching. You sir really are a talented teacher, showing the source code makes the concept so much easier to comprehend.
This is the best Computer Science UA-cam channel I’ve come across. Thank you for addressing difficult concepts in a calm, easy to understand, and friendly manner.
I have watched 30-40 min long videos trying to explain BIT - I didn't get the intuition until I watched this 9 min video! Kudos :) Looking forward to more material...
Your explanation was amazing. Your narration and animation made it soo much easier to understand than other videos on this topic. I'm thankful for your efforts.
You are phenomenal. Your understanding of DS is remarkably deep and experienced! Much appreciation for sharing your painstakingly made absolutely lucid videos!! May God Bless You!!!
Your diagram that starts at 3:01 explains it really clearly, much better than any tree-like depiction. I also liked your observation regarding the correlation between the rightmost bit set and the range that the given array cell covers. Additionally, while loop runs as many times as there are 1 bits in a binary representation of a number - also a great observation. A quality video and a great explanation, thank you, my Russian friend! Upvoted.
Thanks for the words of encouragement! This kind of feedback really does motivate me to put time and effort into making new videos. By the way, I posted a new one just now (ua-cam.com/video/oAR_EYd8im0/v-deo.html). That one is more of a brain teaser/coding problem but it builds on the information from this video. I hope you like.
hey Andre, this video on Fenwick Tree is one of the most insightful videos I have seen on UA-cam on DSA. The explanation and the supporting visualization is incredibly intuitive. I keep coming back to this video to refresh my understanding on Fenwick Tree. Really appreciate the efforts you have taken to polish the visualization part (through PPT I felt). Please do continue teaching DSA like the way you do. Your channel will soar like the bar graph in you profile pic :)
Thanks for the words of encouragement! I came across a few videos explaining Fenwick Trees that had good bits and pieces here and there. But none (that I could find) had a short and intuitive explanation from start to finish. Hence I made this video. Thanks for watching!
Wao !! this channel only makes quality content. Awesome , why is there even 1 dislike in this video. These are some of the best explained videos on youtube.
Thanks, more videos are in the making! By the way, if you are interested in Fenwick Tree data structure, you may also enjoy this video on Segment Trees: ua-cam.com/video/xztU7lmDLv8/v-deo.html Cheers, and let me know which other topics you'd like me to cover!
WAHHHH! YOU HAVE NO IDEA HOW MUCH YOU HELPED MAN! I qualified for the national olympics of informatics in my country and binary index trees are often used to solve the given problems. It's the one piece of syllabus that I didn't quite understand. You helped me out immensely with this video, thank you!
Thanks, will do! By the way, I am constantly prowling for new and interesting topics to cover. Please do let me know if there something that you'd like to see discussed on this channel. Cheers!
@@stablesort I always struggle with proving greedy algorithms or even understanding if stumbled on the correct solution. If you happen to have any tips on how to approach greedy algorithms in general, that would be awesome.
@@AlekseiMaide Yeah, proving correctness is always difficult... OK, are you thinking of greedy "shortest path in a graph" type of algorithms, like Bellman-Ford/Dijkstra's? There may be a few tutorials on how they operate, but may be not on how to prove them to be correct. Thanks for suggestion!
@@stablesortI didn't have any specific algorithms in mind, but algorithm design in general for the group of problems where the sub-problems do not overlap and at every step its possible to make an optimal decision, yet it may be quite evasive. Something in terms of how to build a hypothesis, what to consider, intuition etc. (My main interest lies with competitive programming and I know for a fact that a lot of people struggle with greedy algorithmic challenges) Example of a trivial, yet somewhat evasive problem: codeforces.com/contest/282/problem/B Anyway, It's just an idea for a video, I proposed it because I figured you might have some interesting insights, if you don't, its totally fine, I will watch whatever you post :)
Another topic I have really struggled finding good quality explanation for is "multi dimensional knapsack" problems.... 0/1 Knapsack is well covered... but not m-dimensional ones.
Great video! Very clear explanation! By the way, when you say "last set bit", it is a bit ambiguous -- that is, you would need to clarify or define what you mean by "first" or "last" beforehand; maybe, "least significant set bit" or "right-most set bit" is less ambiguous.
Just read 3 articles without understanding what a Fenwick Tree was, and then I came here. Good work!
Glad to hear that this video was helpful!
Best explaination on FT so far i have seen..
Thanks for the compliment! By the way, I am looking for a subject for the next video. So if you have any suggestions, please do let me know. Thanks!
@@stablesort how about FFT algorithm to compute coefficients of polynomial p3 (where p3 = p1*p2; p1, p2, p3 are polinomials)
@@AshwaniYadavIIT Thanks for an interesting suggestion! It's only been 20 years since I did anything with Fast Fourier transform =) I am adding it to my list. Cheers!
@@stablesort It would be great if you could explain an algorithm to settle that account among n number of friends, given an array indicating the amount each person will receive (+) or has to give (-) to settle the account. I am not aware of any greedy algorithms to solve this
@@neyyars Thanks for this suggestion. I'll add it to my list. Cheers!
jesus christ, you are a very gifted teacher.
WOW, thanks! I hope my other videos can live up to your expectations =)
Every video of this guy is incredible... not sure how much time you have been putting into this work, kudos to you.
Thanks for the encouragement, Renjie! Sometimes I do think that I am putting way too much time into these videos. But reading your comments feels like an adrenaline shot that keeps me going =)
This is the best explanation of this concept anywhere on the internet. Amazing work.
This man is saving me in Algorithms right now, goodspeed
Clear and concise intuition building with splitting array
sir u dont know how much this video help me, appreciate it
glad to hear it!!!
This is such a good explanation, thank you!
Amazing. The best tutorial for BIT
Thanks for the compliment!
Your huge amount of effort that you put into these beautifully concise and crystal clear videos pays off by saving valuable time of thousands of students that learn from these super well made videos far greater than any other videos on UA-cam!! I hope this gem of a channel never stops producing such high quality content.
Thank you for leaving such a wonderful compliment!
I love this guy's video. Great work. Look forward to your next episode.
You made is so simple to understand and write and recollect when needed
Thanks!
Great video! Much better than those hour long video loaded with ads. Thank you!
You are very welcome!
That's the best explanation of Fenwick tree I've found on the internet
Thank you, I do appreciate your good words.
This is the only video that explains how the Fenwick tree came into existence and why we have to travel with 2's complement, Thankyou!!
Thanks for the good words!
The best explanation on BIT I have ever seen!!
Note at 4:07, the index 14 should be 15 - "2" = 13 rather than "1".
Yeap, well noted - thanks for keeping me honest!
You are a fantastic educator. If you've ever watched competitive programming streams where they explain the answers you'll know being good at something and being able to explain something are two very different things. You have done the community quite a service in bringing such clear explanations!
Very clear and concise. I was struggling to wrap my arms around this algorithm until I watched this video. Thank you so much!
Thank for leaving a compliment! Glad to hear that it made sense =)
This video is so incredible!! This is the most clear explanation of Fenwick Tree Ive seen so far! Thank you so much for this
Thanks for the clear, concise and calm explanation. Your calmness makes it so much easier to learn :)
Thank you, that's a very nice compliment, I do appreciate it. I'll do my best to keep it up. By the way, after publishing each video, I start looking for a new topic to cover. So if you have any suggestions, please do let me know. Thanks!
@@stablesort thank you. I am still new to data structures and algorithms so I will definitely let you know as I come across more stuff.
Thanks for the tutorial, a good accent, drawings & calm voice helps a lot in these videos, keep it up.
Hehe, chuckling about the accent comment :)
@@stablesort HOLY, the video is 2y old and you replied in 1h lol, thats the first time thats happened to me, also, lol
Your videos are some of the best on UA-cam. Incredibly clear and such interesting algorithms. I love how you explain the simple version of an algorithm before explaining the final version, makes things so clear!
Thank you for such a wonderful compliment!
There’s so many videos on computer algorithms on the internet these days, but hardly any could match up to the caliber of your videos. I am not sure how you manage to make these high-quality videos continuously but I am very thankful you do and kudos to you from Taiwan!
Hello from Los Angeles, and thank you for the kind words!
You're the best, I'm learning so much about trees from your channel!!!
Glad to hear it!
Every second of this 9 mins video is worth watching. You sir really are a talented teacher, showing the source code makes the concept so much easier to comprehend.
Insanely clear. Best explanation ever!
Cheers!
Best explanation of fenvik tree I have seen
The way you are explaining man, your channel is gonna be huge, keep up the good work 👍🏻
I do appreciate your vote of confidence!
This is the best video on BIT. The visualization is truly amazing.
Thanks for the compliment!
Excellent diagrams and animations. Thank you!
Nicely done! Was reading a book on this and was having a hard time understanding the authors, thanks for this clear explanation
This is the best Computer Science UA-cam channel I’ve come across. Thank you for addressing difficult concepts in a calm, easy to understand, and friendly manner.
Wow, thank you for such a warm compliment!
Awesome video! I had never heard of Fenwick trees, but now I know even how to implement one. Thanks!
I have watched 30-40 min long videos trying to explain BIT - I didn't get the intuition until I watched this 9 min video! Kudos :) Looking forward to more material...
Awesome, thank you! That was also my original motivation for making the tutorial - could not find one out there and so decided to make my own =)
Your explanation was amazing. Your narration and animation made it soo much easier to understand than other videos on this topic. I'm thankful for your efforts.
Very clear explanation and awesome illustration! thank you!!
You are very welcome! Thanks for leaving a good word!
I can't be more thankful that I found this best ever video! Precise and concise, elegant!
Wow, thank you! Glad to hear that it was helpful!
The best video of Fenwick tree I've seen so far! Thx a lot !!!!
My pleasure! Thanks for the compliment!
Finally i understand how a binary indexed tree works.Thank you
Glad it helped!
Damn..best explanation on YT
You are phenomenal. Your understanding of DS is remarkably deep and experienced! Much appreciation for sharing your painstakingly made absolutely lucid videos!! May God Bless You!!!
The only source that can help me understand BIT in 10 minutes.
glad to hear it!
Your diagram that starts at 3:01 explains it really clearly, much better than any tree-like depiction. I also liked your observation regarding the correlation between the rightmost bit set and the range that the given array cell covers. Additionally, while loop runs as many times as there are 1 bits in a binary representation of a number - also a great observation. A quality video and a great explanation, thank you, my Russian friend! Upvoted.
Thank you for leaving such a detailed account of what you liked about the video! This is useful feedback for me; I do appreciate it. Cheers!
This is an excellent video. Subscribed immediately. Please post videos regularly.
Thanks for the words of encouragement! This kind of feedback really does motivate me to put time and effort into making new videos. By the way, I posted a new one just now (ua-cam.com/video/oAR_EYd8im0/v-deo.html). That one is more of a brain teaser/coding problem but it builds on the information from this video. I hope you like.
You explained the difficult concept so crisply and intuitively sir. Thank you 🙏
You are very welcome! Thanks for leaving such a wonderful compliment!
Such perfect explanation! just WOW!
Great stuff man - I rarely comment, but really have to tip my hat off to you. Thanks for putting all the effort in - it makes a difference :)
Glad to hear it! Thanks for the compliment!
excellent, clear, concise explanation. subbed!
Thanks for the good words
I just wanted to say, this is an extremely well made video and helped me a lot. Thank you
Thank you so much for your efforts. As usual, your explanation is the best one so far imo.
Thanks for the good words, I do appreciate it 😊
hey Andre, this video on Fenwick Tree is one of the most insightful videos I have seen on UA-cam on DSA. The explanation and the supporting visualization is incredibly intuitive. I keep coming back to this video to refresh my understanding on Fenwick Tree. Really appreciate the efforts you have taken to polish the visualization part (through PPT I felt). Please do continue teaching DSA like the way you do. Your channel will soar like the bar graph in you profile pic :)
First time on this channel, AND I LOVE IT! Thank you ,sir.
Excellent.The best i could find for FT.Hope to see more videos from you on other topics as well.You really deserve more views.
Thanks a lot! More to come!
Nice tutorial of a complex topic!
Thanks! More interesting episodes come out soon!
Really a good explanation of Fenwick Tree in a very short time, kudos to you.
Glad it was helpful!
This video is really helpful! Such a clear explanation of a difficult topic!
Thanks for the words of encouragement! I came across a few videos explaining Fenwick Trees that had good bits and pieces here and there. But none (that I could find) had a short and intuitive explanation from start to finish. Hence I made this video. Thanks for watching!
Awesome video. Did not know we can populate Fenwick tree in linear time
Excellent introduction of Fenwick Tree. Thanks Mr. Violentyev
You are very welcome and thanks for the compliment!
thanks for helping me gain an appreciation for this structure
nice video, thanks for sharing knowledge
Thanks for the clear and short explanation. Please keep making videos, you are good at that 👏
Thanks, will do!
Wao !! this channel only makes quality content.
Awesome , why is there even 1 dislike in this video.
These are some of the best explained videos on youtube.
Thanks! 😊
Good explanation, thank you.
Thanks for the compliment! Cheers!
You are underrated man, thanks for the awesome tutorial :)
Thanks for the compliment!
@@stablesort :)
Very nicely explained!
the best explanation ever
thank you
Glad it was helpful!
Thank you for this video! It's really short and very informative. Waiting for more!
Thanks, more videos are in the making! By the way, if you are interested in Fenwick Tree data structure, you may also enjoy this video on Segment Trees: ua-cam.com/video/xztU7lmDLv8/v-deo.html
Cheers, and let me know which other topics you'd like me to cover!
Thank you, Andre!
You are very welcome, Ivan!
Thank you! It is a very detailed and good animated video
Your fan club is growing hombre...
wow, great animations and to the point explanation. LOVE IT!!
Glad you liked it!
This is so easy to understand.. Thank you so much!
Thanks! Glad to hear that it made sense :)
Great explanation, thank you!
Amazing content! This concept is now rooted in my brain and thanks to you.
Thank you for helping me visualise it
I am glad to hear that it helped!
Very nice explanation! Good job
Great video, thank you!
I am glad to hear that you liked it!
@@stablesort Sharing how to make the tree in linear time was helpful 😊
Nicely explained!
Thanks! I am glad you liked it.
Thank you so much for the clear explanation.
WAHHHH! YOU HAVE NO IDEA HOW MUCH YOU HELPED MAN! I qualified for the national olympics of informatics in my country and binary index trees are often used to solve the given problems. It's the one piece of syllabus that I didn't quite understand. You helped me out immensely with this video, thank you!
WOW, good luck at the info olympics!
Very good explanation, thank you very much!
Thanks a lot,love from India.
You are very welcome!
Great video!
Thanks for the compliment!
This channel is amazing
Thanks for the compliment!
This is soooooo gooooood, please make more videos on advanced DS
Thanks, will do! By the way, any specific requests?
@@stablesort Thanks for asking. Suffix Arrays and Trees, Segment Trees and Tries.
@@rupjitchakraborty8012 Cool, those are good suggestions. Adding to my to-do list. Thanks!
great video, thank you very much for the help.
You are very welcome; I am glad you like it!
masterfully done! 👏
LEGEND
Great explanation, thanks
Glad it was helpful!
Very well Done!!
This man is making ASMR for programmers
Great video man!
best visualization 🔥
Amazing video, please keep up the good work! :)
Thanks, will do! By the way, I am constantly prowling for new and interesting topics to cover. Please do let me know if there something that you'd like to see discussed on this channel. Cheers!
@@stablesort I always struggle with proving greedy algorithms or even understanding if stumbled on the correct solution. If you happen to have any tips on how to approach greedy algorithms in general, that would be awesome.
@@AlekseiMaide Yeah, proving correctness is always difficult... OK, are you thinking of greedy "shortest path in a graph" type of algorithms, like Bellman-Ford/Dijkstra's? There may be a few tutorials on how they operate, but may be not on how to prove them to be correct. Thanks for suggestion!
@@stablesortI didn't have any specific algorithms in mind, but algorithm design in general for the group of problems where the sub-problems do not overlap and at every step its possible to make an optimal decision, yet it may be quite evasive. Something in terms of how to build a hypothesis, what to consider, intuition etc.
(My main interest lies with competitive programming and I know for a fact that a lot of people struggle with greedy algorithmic challenges)
Example of a trivial, yet somewhat evasive problem:
codeforces.com/contest/282/problem/B
Anyway, It's just an idea for a video, I proposed it because I figured you might have some interesting insights, if you don't, its totally fine, I will watch whatever you post :)
Another topic I have really struggled finding good quality explanation for is "multi dimensional knapsack" problems.... 0/1 Knapsack is well covered... but not m-dimensional ones.
Highly grateful for such a wonderful explanation _/\_
Great video! Very clear explanation!
By the way, when you say "last set bit", it is a bit ambiguous -- that is, you would need to clarify or define what you mean by "first" or "last" beforehand; maybe, "least significant set bit" or "right-most set bit" is less ambiguous.
Awesome video. Thanks.
really loved it ❤
the video is very helpful anh fun , thanks for the video