The problem “Fruit Into Baskets” asks for the length of the longest contiguous subarray that contains at most two distinct fruit types. Think…
Browsing: Intermediate
The problem “Max Consecutive Ones III” asks for the length of the longest subarray containing only 1s after flipping at most k zeros to 1s. This is a classic sliding window problem where we maintain…
The problem “Longest Substring Without Repeating Characters” asks for the length of the longest substring in a string s that contains no duplicate characters. A straightforward brute force approach…
We are given an array asteroids of integers representing asteroids in a row. The indices of the asteriod in the array represent…
Given an array of integers arr, find the sum of min(b), where b ranges over every (contiguous) subarray of arr. Since the answer may…
Given an array arr[], partition it into two subsets(possibly empty) such that each element must belong to only one subset. Let…
Given an array arr of non-negative integers and an integer target, the task is to count all subsets of the array whose sum…
This problem is a direct extension of the Subset Sum Problem: instead of checking if any subset sums to a given…
Given an array of positive integers arr[] and a value sum, determine if there is a subset of arr[] with sum equal to given sum. Here’s…
Given a circular integer array nums (i.e., the next element of nums[nums.length – 1] is nums[0]), return the next greater number for every element in nums. Here’s the [Problem…