MMuppidi Srinivas·Feb 23Mastering Fenwick Tree for Competitive ProgrammingCrack range queries and updates in O(log n) with this powerful and easy-to-implement data structure.11 min read·srinivastechblog.hashnode.dev
AArka Infotech·Jan 11, 2025Binary Indexed Tree (BIT): A Tool for Efficient QueriesBinary Indexed Trees optimize prefix sums and updates, ideal for competitive programming and data structure efficiency6 min read·blogs.arkainfotech.in
NNitesh Kushwaha·Mar 3, 2024Secret Data Structures of C++: PBDS LibraryThis contains the secret data structures of C++ like Ordered_Set from PBDS Library.5 min read·niteshim111.hashnode.dev
AAman Nadaf·Mar 9, 2023Fenwick TreeIts job is similar to a segment tree. But the code is very short and easy to write. Here, we will be discussing the classical Dynamic Range Sum Queries prob5 min read·teckbakers.hashnode.dev