Sliding Window Technique: A Powerful Tool for Subarray ProblemsLearn the Sliding Window technique to efficiently solve subarray and substring problems and reduce time complexity from O(N²) to O(N).4 min read·srinivastechblog.hashnode.devMar 16
Understanding Graphs, Recursion, and Depth First Search (DFS) Discover how recursion helps DFS explore graphs deeply and efficiently.10 min read·srinivastechblog.hashnode.devMar 16
Mastering 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.devFeb 23
Mo’s Algorithm – Step by Step GuideA powerful trick to handle complex range queries in competitive programming10 min read·srinivastechblog.hashnode.devFeb 21
Efficient Range Queries Using Sqrt DecompositionLearn how Sqrt Decomposition speeds up range queries6 min read·srinivastechblog.hashnode.devFeb 21