AAbirami Sri·Sep 16Day 10 of My 30-Day DSA Journey - Sliding Window PatternDay 10 of my DSA journey with JavaScript: solve 4 LeetCode problems using Variable Sliding Window, Two Pointers, and Frequency Maps.12 min read·abi-blog.hashnode.dev
AAnnet·Sep 13Sliding Window Pattern in DSA: A Beginner-Friendly GuideLearn the Sliding Window pattern in DSA with simple examples, Python code, LeetCode problems, and tips for recognizing the pattern.7 min read·html-portfolio.hashnode.dev
AAbirami Sri·Sep 10Day 8 of My 30-Day DSA Journey - Sliding Window PatternLearn the Sliding Window pattern in JavaScript with LeetCode 424, 567 and 438 using frequency arrays, fixed and variable windows.14 min read·abi-blog.hashnode.dev
AAbirami Sri·Sep 8Day 7 of My 30-Day DSA Journey - Sliding Window PatternDay 7 of my DSA journey: learn the Sliding Window pattern by solving Maximum Average Subarray I and Maximum Number of Vowels in a Substring.8 min read·abi-blog.hashnode.dev
AAbstract Algorithms·Jul 2Sliding Window TechniqueOptimize nested loops by converting O(N^2) algorithms to linear O(N) using a sliding window.1 min read·abstractalgorithms.hashnode.dev
SSneha Poojary·May 26Sliding Window Algorithm Explained Visually | From Brute Force to OptimizationMaster One of the Most Important DSA Patterns4 min read·dsamadesimple.hashnode.dev
DDeepanjli·May 20Day1Did 2 leetcode problems- Sliding Window MaximumLearned about monotonic queues.. Implementation . Also learned even if algorithm is same, some things can still increase runtime.1. static int dq[100005]1 min read·bunnylearnscode.hashnode.dev
SShubham Kumar Singh·Apr 28Sliding WindowLearn the Sliding Window algorithm with simple examples, dry runs, and code. Master this key DSA pattern for coding interviews and problem solving.3 min read·shubhamsinghbundela.hashnode.dev
VVrinda Kansal·Apr 9Backpressure Mechanisms: A Developer's Guide to Choosing the Right StrategyTactical Java primitives that meet most backpressure needs12 min read·vrindakansal.hashnode.dev
AAbstract Algorithms·Mar 29Sliding Window Technique: From O(n·k) Scans to O(n) in One PassEliminate redundant subarray re-scanning by maintaining a running aggregate across an expanding and shrinking boundary.16 min read·abstractalgorithms.hashnode.dev