MMuppidi Srinivas路Feb 23Mastering Fenwick Tree for Competitive ProgrammingCrack range queries and updates in O(log n) with this powerful and easy-to-implement data structure.11 min read路srinivastechblog.hashnode.dev
AAlgoAvengers 馃殌路Aug 19, 2025馃 Mastering the Prefix Sum Pattern: Your Ultimate Guide to Conquering Range-Based ProblemsMaster the Prefix Sum technique in Data Structures and Algorithms with this comprehensive guide14 min read路algoavengers.hashnode.dev
AArka Infotech路Jan 11, 2025Sparse Tables: Algorithms for Range QueriesSparse Tables optimize range queries to constant time after preprocessing, ideal for idempotent operations like min, max, and gcd7 min read路blogs.arkainfotech.in