Aman NadafforTeckbaker's Blogteckbakers.hashnode.dev·Mar 9, 2023Fenwick TreeHello Readers, Introduction Here, I will be discussing an interesting data structure called "Fenwick Tree". Its structure was proposed by Boris Ryabko and was described by Peter Fenwick in an article from 1994. It is also called the "Binary Indexed T...1 like·34 readsDSA#iRatherFear
Aman NadafforTeckbaker's Blogteckbakers.hashnode.dev·Feb 28, 2023Difference Array TechniqueTechnique It is a simple technique that can give you an end array after performing range queries of the form update(l, r, x). NOTE: update(l, r, x) means add x to all the elements in an array within the range l to r. arr[l] += x, arr[l + 1] += x, arr...2 likes·359 readsDSAalgorithms
Aman NadafforTeckbaker's Blogteckbakers.hashnode.dev·Jan 18, 2023Binary SearchBinary search (BS) is one of the most important concepts in CP algorithms in general. You will use binary search everywhere. We will see what is BS, the different implementations of BS, what are the things to remember while implementing BS, what is s...3 likes·166 readsDSACompetitive programming
