Learn about the Fenwick Tree or Binary-Indexed Tree data structure, which allows you to perform range sum queries and point updates in just O(log n) time. In this video, we compare it to other approaches (prefix sum, naive loop) to motivate the benefits of…

Support me and future courses !!!

https://visual-kernel-shop.fourthwall.com
https://buymeacoffee.com/visual_kernel


Chapters:
0:00 Intro
1:22 Variable
15:27 If & Else
30:41 List
42:31 For Loop
55:08 Range()
1:10:04 Double…

Enjoy the videos and music you love, upload original content, and share it all with friends, family, and the world on YouTube.