Bottom-up Iterative Segment Treeধরা যাক, আমাদের একটি array আছে: a = [5, 2, 7, 3, 6, 1, 4, 8] আমাদের দুই ধরনের operation করতে হবে: একটি position-এর value update করা। কোনো range-এর sum বের করা। উদাহরণ: sum of a[2...6] সরাসরি loo12 min read·worldofprogramming.hashnode.devJun 21
চিন্তা করার আনন্দA Bengali reflective blog on the joy of thinking, curiosity, problem-solving, education, mathematics, chess, algorithms, and personal growth.5 min read·worldofprogramming.hashnode.devMay 25
Fast & Slow PointersLearn the fast & slow pointers technique for detecting cycles, finding midpoints, and solving problems efficiently in linked lists and arrays2 min read·worldofprogramming.hashnode.devSep 27, 2025
Two PointersTwo Pointers Definition: Use two indices to traverse an array/string, either from opposite ends (left/right) or at different speeds. Key Idea: Reduce search space or compare elements without scanning everything twice. Typical Uses: Check if array...2 min read·worldofprogramming.hashnode.devSep 17, 2025
Sliding Window (Python)Definition: A specific type of two-pointers where the pointers define a window (subarray or substring), and this window slides (expands/shrinks) to maintain some property. Common Usage: Substring or subarray problems Problems involving "longest", "...2 min read·worldofprogramming.hashnode.devSep 14, 2025
