binary-indexed-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.

avl-tree algorithms data-structures dynamic-programming binary-indexed-tree time-complexity-constraints

UpdatedNov 30, 2025
C++

shiningflash /Advance-Data-Structure

Star9

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

c-plus-plus data-structure stack queue stl disjoint-set segment-tree ordered-set trie-tree lazy-propagation binary-indexed-tree sqrt-decomposition advance-data-structure

UpdatedMar 23, 2021
C++

jemshit /DataStructures

Sponsor

Star6

Data Structures naively implemented in Kotlin for learning purpose

kotlin avl-tree stack queue algorithms trie priority-queue data-structures binary-search-tree hash-table disjoint-set lcp-array union-find suffix-array fenwick-tree binary-indexed-tree

UpdatedOct 5, 2022
Kotlin

dstein64 /fenwick

Star6

An implementation of Fenwick trees (Fenwick 1994).

data-structures fenwick-tree binary-indexed-tree

UpdatedJan 1, 2025
Python

paras2411 /Algorithms

Star6

Algorithms useful for CS graduates

algorithms kmp-algorithm combinatorics combinations dijkstra topological-sort rabin-karp segment-tree dfs-algorithm dijkstra-algorithm sieve-of-eratosthenes kruskal-algorithm prim-algorithm matrix-exponentiation bfs-algorithm fenwick-tree rabin-karp-algorithm z-algorithm binary-indexed-tree van-emde-boas

UpdatedOct 19, 2020
C++

skyzh /data-structure-deque

Star5

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

cpp deque fenwick-tree binary-indexed-tree

UpdatedFeb 17, 2020
C++

HenryRLee /fenwick-tree

Sponsor

Star5

A C++ Fenwick Tree Library

fenwick fenwick-tree binary-indexed-tree

UpdatedJan 17, 2025
C++

ViktorSlavkovic /Fenwick

Star5

Analysis, Implementation and Applications of Fenwick Trees

algorithms data-structures fenwick rmq rmq-problem fenwick-tree binary-indexed-tree

UpdatedSep 15, 2018
C++

gevg /bit

Star2

Binary Indexed Tree

go golang algorithms-and-data-structures fenwick-tree binary-indexed-tree

UpdatedFeb 17, 2021
Go

klyashko /algorithm-playground

Star2

avl-tree algorithms kd-tree competitive-programming interval-tree huffman-tree binary-heap aho-corasick segment-tree leetcode-java suffix-tree suffix-array fenwick-tree binary-indexed-tree suffix-automaton palindromic-tree sparse-table heavy-light-decomposition splay-tree bit-map

UpdatedNov 8, 2019
Groovy

legolas-1 /DS-Algo

Star1

Popular algorithms and data structures implementation

cpp disjoint-set segment-tree dijkstra-algorithm strongly-connected-components lazy-propagation binary-indexed-tree dynamic-segtree

UpdatedMay 15, 2020
C++

codehub001 /CrackYourInternship

Star1

45 Days DSA Challenge with Arsh Goyal

sorting stack queue math graph string matrix array merge greedy dynamic-programming sliding-window binary-indexed-tree twopointers

UpdatedMay 12, 2025
C++

WillKirkmanM /fenwick

Star1

A Fenwick Tree, Also Known as a Binary Indexed Tree (BIT), is a Specialised Data Structure Designed for Efficiently Handling Two Types of Operations on an Array of Numbers

fenwick binary-indexed-tree parsonlabs

UpdatedDec 11, 2025
Rust

MatijaEskicWork /Algorithmic-Problems

Star1

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.