Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedGiven an array and a positive number k, check whether the array contains any duplicate elements within the range k. If k is more than the array’s size, the solution should check for duplicates in the complete array.
Given an array and an integer k, find the count of distinct elements in every subarray of size k.
Given an integer array, print all maximum size subarrays having all distinct elements in them.
Given a binary array, find the index of 0 to be replaced with 1 to get a maximum length sequence of continuous ones using the sliding window technique.
Given an array of sorted integers that may contain several duplicate elements, count the total number of distinct absolute values in it.
Given an array of positive integers, find the smallest subarray’s length whose sum of elements is greater than a given number k.
Given an integer array, find a subarray having a given sum in it.
Given an integer array, find the minimum sum subarray of size k, where k is a positive integer.
Given a binary array, find the maximum sequence of continuous 1’s that can be formed by replacing at most k zeros by ones.
Given a string, find the longest substring containing distinct characters using sliding window technique in linear time.
Find all substrings of a string that contains all characters of another string. In other words, find all substrings of the first string that are anagrams of the second string.
Given a string and a positive number k, find the longest substring of the string containing k distinct characters. If k is more than the total number of distinct characters in the string, return the whole string.