@umair01
Turning Logic Into Impact — One Algorithm at a Time
Nothing here yet.
Nothing here yet.
Sep 11, 2025 · 4 min read · 📚 Understanding Stack in Data Structures Stacks are one of the most fundamental and powerful linear data structures in computer science. If you’ve ever used the “undo” button in Word, navigated a web browser with “back” and “forward”, or evaluated m...
Join discussion
Aug 31, 2025 · 3 min read · 🚀 Mastering Z-Algorithm: Fast String Matching Explained with C++ 📌 Problem Statement Given a text string T and a pattern string P, we want to find all occurrences of P inside T efficiently.Traditional string matching (like the brute force approach)...
Join discussion
Aug 23, 2025 · 4 min read · 🚀 Mastering KMP (Knuth–Morris–Pratt) String Matching Algorithm 📌 Introduction When working with text processing, one of the most common problems is finding a substring (pattern) inside a larger string (text). The naive approach checks all possibil...
Join discussion
Aug 21, 2025 · 4 min read · Rabin-Karp Algorithm: String Matching with Rolling Hash String matching is one of the fundamental problems in Data Structures and Algorithms (DSA).Among the most famous algorithms for pattern searching is the Rabin-Karp Algorithm, which uses hashing ...
Join discussion
Aug 12, 2025 · 5 min read · Binary Search on Answers — The Secret Weapon for Many Hard Problems 📌 Introduction When we think about binary search, the first thing that comes to mind is searching for a target in a sorted array. But binary search is much more powerful than that —...
Join discussion