Will the Guru

Tag: Sliding Window

  • Rate Limiter #3 – Sliding Window Algorithm

    Advantages / Disadvantages Advantages Disadvantages Implementation Implementation – Output FollowUp Questions #1. How does your Sliding Window Counter implementation handle memory consumption, especially with high request rates or large window sizes? Are there optimizations to reduce memory usage? #2. The same FollowUp Question #1~#5 in https://willtheguruhome.wordpress.com/2025/01/12/rate-limiter-token-bucket-algorithm/ is possible

  • Longest Substring Without Repeating Characters

    Problem https://leetcode.com/explore/interview/card/leetcodes-interview-crash-course-data-structures-and-algorithms/705/hashing/4690/ Solution

  • Minimum Consecutive Cards to Pick Up

    Problem https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/description/ Solution

  • Count Number of Nice Subarrays

    Problem https://leetcode.com/problems/count-number-of-nice-subarrays/description/ Solution

  • Counting the number of subarrays

    문제들 중, 특정 조건을 부합하는 subarray의 갯수를 구하는 문제 유형이 있다. 예를 들어, subarray 의 합이 k 가 되는 subarray 의 갯수를 구하라는 문제가 있다면, 이는 prefixSum + hashmap 을 통해 풀 수 있다! Problem https://leetcode.com/problems/subarray-sum-equals-k/description/ Solution Reference

  • Maximum Average Subarray I

    Problem https://leetcode.com/problems/maximum-average-subarray-i/description Solution Notes

  • Max Consecutive Ones III

    Problem https://leetcode.com/problems/max-consecutive-ones-iii Solution Notes

  • Sliding Window

    Pseudo Code – Moving two pointers dynamically Pseudo Code – Moving two pointers dynamically (Detailed Version) Pseudo Code – Fixed window size Reference