4 docs tagged with "sliding-window"

This question is asked by Google. Given an array, nums, and an integer k, return whether or not two unique indices exist such that nums[i] = nums[j] and the two indices i and j are at most k elements apart.

Given a string s, return the length of the longest substring containing at most two distinct characters.

Given a string s, return the length of the longest substring that contains only unique characters.

Given a string s, return all of its repeated 10 character substrings.