Feb 5 · 5 min read · In this article I intend to provide greater insight on how to Construct a MS. Many articles exist explaining its applicability. But constructing MS might be confusing. However, after reading this article reader will be able to intuitively design diff...
Join discussion
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 18, 2025 · 3 min read · 1. Introduction Stacks and queues are two of the most fundamental data structures in computer science. They serve as building blocks for more complex algorithms and are frequently used in coding interviews. In this post, we’ll explore how they work, ...
Join discussion
Aug 13, 2025 · 6 min read · The Core Idea A monotonic stack is just a stack that keeps its elements in sorted order (increasing or decreasing).When a new element breaks the rule, we pop until the rule is happy again. Why store indices instead of values?Because we often need to ...
Join discussion
Jul 14, 2025 · 3 min read · Problem Description 503. Next Greater Element II The "Next Greater Element II" problem asks you to find the next greater element for each element in a circular array. For each element, you need to find the first element that is greater than it when...
Join discussion
Jul 14, 2025 · 4 min read · Problem Statement 456. 132 Pattern Given an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j], nums[k] such that i < j < k and nums[i] < nums[k] < nums[j]. Return true if there is a 132 pattern in nums, oth...
Join discussion
Jul 13, 2025 · 3 min read · Problem Overview LeetCode 316 Remove Duplicate Letters Remove duplicate letters from a string such that every letter appears exactly once, and the result is the lexicographically smallest possible string. Algorithm Breakdown Step 1: Track Last Occu...
Join discussion
Jul 13, 2025 · 4 min read · Ever written a nested loop, stared at your O(n²) time, and whispered “there has to be a better way”? There is. And it’s 🔥. Monotonic Stacks and Queues are those underdog tricks that seem obscure... until they make your entire codebase faster and pre...
Join discussion
Jul 10, 2025 · 4 min read · LeetCode 496. Next Greater Element I The LeetCode problem "496. Next Greater Element I" asks us to find the first greater element to the right of each element in nums1 within nums2, where nums1 is a subset of nums2. If no such element exists, return...
Join discussion
Jun 22, 2025 · 10 min read · Originally published on Substack . If you’ve been grinding LeetCode, you've probably stumbled upon this problem: LEETCODE - 739”Given an array of daily temperatures, return an array where each element tells you how many days you have to wait until a ...
Join discussion