---
title: "Programming Blogs (@saberazinia) | Hashnode"
description: "Programming Blogs (@saberazinia) writes on Hashnode. Read their latest articles and follow their work."
url: "https://hashnode.com/@saberazinia"
---

@saberazinia

# Programming Blogs

@saberazinia · Joined July 2025

### [Bottom-up Iterative Segment Tree](https://worldofprogramming.hashnode.dev/bottom-up-iterative-segment-tree?utm_source=hashnode&utm_medium=feed)

ধরা যাক, আমাদের একটি array আছে: a = \[5, 2, 7, 3, 6, 1, 4, 8\] আমাদের দুই ধরনের operation করতে হবে: একটি position-এর value update করা। কোনো range-এর sum বের করা। উদাহরণ: sum of a\[2...6\] সরাসরি loo

12 min read · [worldofprogramming.hashnode.dev](https://worldofprogramming.hashnode.dev/bottom-up-iterative-segment-tree?utm_source=hashnode&utm_medium=feed)

[Jun 21](https://hashnode.com/posts/bottom-up-iterative-segment-tree/6a3827ef79c094ab4016132c)

### [চিন্তা করার আনন্দ](https://worldofprogramming.hashnode.dev/the-joy-of-thinking?utm_source=hashnode&utm_medium=feed)

A Bengali reflective blog on the joy of thinking, curiosity, problem-solving, education, mathematics, chess, algorithms, and personal growth.

5 min read · [worldofprogramming.hashnode.dev](https://worldofprogramming.hashnode.dev/the-joy-of-thinking?utm_source=hashnode&utm_medium=feed)

[May 25](https://hashnode.com/posts/the-joy-of-thinking/6a1466707d85e6a1afe7cb19)

### [Fast & Slow Pointers](https://worldofprogramming.hashnode.dev/fast-and-slow-pointers?utm_source=hashnode&utm_medium=feed)

Learn the fast & slow pointers technique for detecting cycles, finding midpoints, and solving problems efficiently in linked lists and arrays

2 min read · [worldofprogramming.hashnode.dev](https://worldofprogramming.hashnode.dev/fast-and-slow-pointers?utm_source=hashnode&utm_medium=feed)

[Sep 27, 2025](https://hashnode.com/posts/fast-and-slow-pointers/68d81b1706d49a317646ef94)

### [Two Pointers](https://worldofprogramming.hashnode.dev/two-pointers?utm_source=hashnode&utm_medium=feed)

Two 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.dev](https://worldofprogramming.hashnode.dev/two-pointers?utm_source=hashnode&utm_medium=feed)

[Sep 17, 2025](https://hashnode.com/posts/two-pointers/68cb1b947628cbd6be1227cd)

### [Sliding Window (Python)](https://worldofprogramming.hashnode.dev/maximum-sum-sub-array-in-python?utm_source=hashnode&utm_medium=feed)

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.dev](https://worldofprogramming.hashnode.dev/maximum-sum-sub-array-in-python?utm_source=hashnode&utm_medium=feed)

[Sep 14, 2025](https://hashnode.com/posts/maximum-sum-sub-array-in-python/68c6ed1b7639554bbd575e7b)