Data Structures & Algorithms
Complete catalog of 113 interactive algorithm visualizers. Browse by data structure category or filter by difficulty.
Determine if there are two distinct indices i and j such that nums[i] == nums[j] and abs(i - j) <= k using a sliding window hash set.
Find the length of the longest substring containing the same letter you can get after performing at most k character replacements using a dynamic sliding window.
Find a contiguous subarray of length k that has the maximum average value using a fixed-size sliding window.
Take exactly k cards from the two ends, exchanging one left card for one right card to find the maximum score.
Find the minimal length of a contiguous subarray of which the sum is greater than or equal to target using a dynamic sliding window.
Slide a window of length s1.length over s2 and compare letter frequencies to find a permutation.