Merge interval pattern: Check if two intervals overlap
Problem Statement: You are given an array, you need to check if any two intervals overlap Example: Input: arr [] = [[1, 7], [2, 8], [3, 6]]…
Merge interval pattern: Find intersection of all intervals
Problem Statement: You are given an array, you need to find the intersection of all the intervals. Example: Input: arr [] = [[1, 7],…
Merge interval pattern: Merge Overlapping Intervals
Problem Statement: You are given an array of intervals arr[i] = [start_i, end_i]. You need to merge all overlapping intervals, so that the…
Sliding Window: Given an array and a target value, get the subarray product less than k
Problem Statement: Given an array and a target value, get the subarray product less than k Example: Input: arr = [1, 2, 4, 3] k = 20 Output: 8…
Sliding Window: Smallest sum of contiguous subarray
Problem Statement: You are given an array and a value K. You need to find the length of minimum sum subarray that is greater or equal to k.…
Sliding Window: Subarray with k different integers
Problem Statement: You are given an array and a value k. You need to return subarray with k different integers. A subarray is a continuous…
Sliding Window: Maximum points you can obtain from cards
Problem Statement: There are cards that are arranged in a row, each card has a number of points. The points are given in the integer array…
Sliding Window: Fruits into baskets
Problem Statement: You are in a farm, the trees are arranged from left to right. Trees are represented by integer array “fruits”…
Sliding Window: Return length of longest subarray with having at most k frequency
Problem Statement: You are given an array of integers and a value k. You need to find the length of the longest subarray, such that the…
Sliding Window: Given a string you need to find the longest non repeating substring
Problem Statement: You are given a string, you need to find the length of the longest substring without duplicate characters Example: Input: s…