-
Notifications
You must be signed in to change notification settings - Fork 18.7k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Fenwick (Binary Indexed Tree) #1535
Comments
I would like to solve this, can u please assign this to me? |
@Rohanfizz hi 👋 I have already solved it in this PR - #1536 🙂 |
can you please give me some other issue..I dont know anything in dev in a competetive programmer and i like problem solving, so im having trouble participating in hackoctober fest :'( |
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
anybody would like to review this? |
This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions! |
There are no such data structures as Fenwick tree. Fenwick (or Binary Indexed Tree) is a data structure that can efficiently update elements and calculate prefix sums in a table of numbers.
Read more here: https://en.wikipedia.org/wiki/Fenwick_tree
The text was updated successfully, but these errors were encountered: