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

A repository made to store files regarding my EE which discusses whether or not an array is a subarray of another array.

Useful datastructures not present in standard Python libraries

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.

efficient construction of binary indexed tree

Data structures of particular interest to me

Pseudo Multiset using Binary Indexed Tree implemented in Python.

In this project, we aim to implement Fenwick Trees to compute sub-matrix operations.

Fenwick Tree (a.k.a. Binary Indexed Tree) using typescript+redis

Binary Indexed (Fenwick) Trees

Some of the data structures useful for Competitive Programming

HackerRank Counting Inversions using binary indexed trees

45 Days DSA Challenge with Arsh Goyal

Popular algorithms and data structures implementation

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.

Binary Indexed Tree

A C++ Fenwick Tree Library