Collection of data structures examples via Java

A Fenwick tree for Zig

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.

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

Data Structures naively implemented in Kotlin for learning purpose

Algorithms useful for CS graduates

An implementation of Fenwick trees (Fenwick 1994).

Analysis, Implementation and Applications of Fenwick Trees

A C++ Fenwick Tree Library

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

Binary Indexed Tree

Popular algorithms and data structures implementation

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

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

45 Days DSA Challenge with Arsh Goyal

Useful datastructures not present in standard Python libraries

Graph-Theory, Number-Theory, Classical Dynamic Programming, Searching-Sorting Algorithms and some Advance-Data-Structures are implemented using C++

Data structures of particular interest to me