01 — Problem Directory
Data Structures & Algorithms
Complete catalog of 99 interactive algorithm visualizers. Browse by data structure category or filter by difficulty.
⌘K
SW
Sliding WindowContains Duplicate II
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.
Sliding WindowHash SetArray
SW
Sliding WindowLongest Repeating Character Replacement
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.
Sliding WindowTwo PointersFrequency Map
SW
Sliding WindowMinimum Size Subarray Sum
Find the minimal length of a contiguous subarray of which the sum is greater than or equal to target using a dynamic sliding window.
ArrayBinary SearchSliding Window+1
