Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upFenwick (Binary Indexed Tree) #1535
Open
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 :'( |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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