Collection of data structures examples via Java

A Fenwick tree for Zig

Advance data structure includes DSU, BIT, SQRT Decomposition, Segment Tree, Lazy Propagation, Trie Tree etc.

Data Structures naively implemented in Kotlin for learning purpose

Analysis, Implementation and Applications of Fenwick Trees

Algorithms useful for CS graduates

An implementation of Fenwick trees (Fenwick 1994).

A deque of O(sqrt n) complexity on access, insert and remove, with an optimization for O(log n) access based on fenwick tree.

Welcome to the CP Vault, I've created this repository for competitive programming resources and notes. This collection covers a wide range of topics like dynamic programming, analyzing time complexity on constraints, algorithms, data structures, and more. It’s a personal vault designed to help you excel in advanced concepts and problem-solving.

A C++ Fenwick Tree Library

My solutions synced by LeetHub while solving algorithmic problems on LeetCode.

Binary Indexed Tree

Popular algorithms and data structures implementation

45 Days DSA Challenge with Arsh Goyal

Volume Computation of 3D Reconstructed Objects From Volumetric Data Using Binary Indexed Tree

Here are solutions from problems that i coded for my assignment, preparing for competitions. They are sorted by some criteria, like DP, greedy, ad hoc, etc.

This project implements the **Binary Indexed Tree** with template. It can obtain the prefix sum in O(log N) time, add or update one item in O(log N) time, random-access in O(1) time. At the same time, we provide a **random access iterator** of the prefix sum. The iterator can interact well with many STL algorithms.

Detailed explanation of Binary Indexed Tree (Fenwick Tree) with C++ implementation.