Sorting & SearchingIn this blog, we will solve sorting and searching problems from the CSES problem set. We will solve some problems and try to understand the logic behind the4 min read·teckbakers.hashnode.devApr 24, 2023
Fenwick TreeIts job is similar to a segment tree. But the code is very short and easy to write. Here, we will be discussing the classical Dynamic Range Sum Queries prob5 min read·teckbakers.hashnode.devMar 9, 2023
Difference Array TechniqueThis is a difference array technique for competitive programming. It can be used to range queries for updating array in range (l, r).6 min read·teckbakers.hashnode.devFeb 28, 2023
Editorial for TechnovationThis 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 lower constraints, one can solve this problem using brute force. But when the constraint is as follo...3 min read·teckbakers.hashnode.devFeb 20, 2023