#sliding-window-algorithm

Boundaries are important: Such as in a rate limiter

~ 2 min read

Window(Interval) rate limiting algoritmlarini yozamiz !

Sliding Windows in Time Series: A Data Scientist’s Guide to Feature Engineering, Validation, and…

“Static machine learning models see the world as a single snapshot. Time-series models with sliding windows see the world as a movie —…

Sliding Window — Turning O(n²) to O(n)

Assume you are given an array: [2, 1, 5, 1, 3, 2] and an integer k=3 You are supposed to find the maximum sum of subarray of size=k.

Sliding Window Techniques & Patterns

1. Upper Bound / At Most Type Problems

Sliding Window Mastery: 3 Problems That Build the Same Muscle

If you’ve ever confused different “substring” problems (I definitely have), you’re not alone. At first glance, these problems feel…

Why I Stopped Thinking About Arrays And Started Thinking About Windows

There’s this specific 3 second window after you hit submit on LeetCode.

The Law of the Late Limiter: The 4am Tax of APIs (How to Avoid It)

Every API pays this tax. The only question is when

Two Pointers — The Complete DSA Pattern Guide

How to identify the pattern, all 3 variants explained visually, and 20 problems ranked by importance.

Dynamic Sliding Window & Two Pointer — Concepts Explained with Examples

In this post i’m gone explained you dynamic sliding window and two pointer concept. first and foremost we have to know why i should use…

DSA Decoded | Day 21: Minimum Window Substring

“This is a running series of posts, where I solve DSA problems and try to explain them as thoroughly as possible for anyone to understand…

DSA Decoded | Day 19: Longest Substring with Atleast K Repeating Characters

“This is a running series of posts, where I solve DSA problems and try to explain them as thoroughly as possible for anyone to understand…

Solution for Frequency of the Most Frequent Element (Leetcode problem:- 1838)

Hi Myself Ariharan, I am a software Engineer with 6 years of experience in software industry. I want to learn DSA, System Design concepts…

Most Frequent N-Gram

Write a function that takes a string s and an integer n, and returns the most frequent n-gram (substring of length n). If there's a tie…

[LeetCode 解題紀錄] 209. Minimum Size Subarray Sum

209. Minimum Size Subarray Sum

API Rate Limiting-Best Strategies in Node.js

In a world where bots and DDoS attacks are constant threats, leaving your API unprotected is like leaving your front door wide open in a…

[LeetCode 解題紀錄] 438. Find All Anagrams in a String

438. Find All Anagrams in a String

[LeetCode 解題紀錄] 167. Two Sum II — Input Array Is Sorted

167. Two Sum II — Input Array Is Sorted

Mastering Sliding Window Techniques

The sliding window technique is a common algorithmic approach used for solving various problems that involve processing or analyzing a…