The problem “Fruit Into Baskets” asks for the length of the longest contiguous subarray that contains at most two distinct fruit types. Think…

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…

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num. Here’s the [Problem…

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 n items, each with a specific weight and value, and a knapsack with a capacity of W, the task is to put the items in…

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…

Given an array arr[] containing non-negative integers, the task is to divide it into two sets set1 and set2 such that the absolute difference between their sums is…