#competitive-programming
Read more stories on Hashnode
Articles with this tag
Hello Readers, Introduction Here, I will be discussing an interesting data structure called "Fenwick Tree". Its structure was proposed by Boris Ryabko...
Technique 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)...
This is an editorial for the Technovation contest. Due to less number of test cases, some brute force leads to "AC" :( Contest Link Problem -A Due to...
here I will be talking about two different things how to prove correctness of solution and how to approach to the solution. ยท Let's look at the idea of...
Binary 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,...
