Shortest Subarray to be Removed to Make Array Sorted Given an integer array arr, remove a subarray (can be empty) from arr such that the remaining elements in arr are non-decreasing. Return the ...
Minimized Maximum of Products Distributed to Any Store You are given an integer n indicating there are n specialty retail stores. There are m product types of varying amounts, which are given as ...
Most Beautiful Item for Each Query You are given a 2D integer array items where items[i] = [pricei, beautyi] denotes the price and beauty of an item respectively. You are also given a 0-indexed ...
Prime Subtraction Operation You are given a 0-indexed integer array nums of length n. You can perform the following operation as many times as you want: Pick an index i that you haven’t picked ...
Shortest Subarray With OR at Least K II You are given an array nums of non-negative integers and an integer k. An array is called special if the bitwise OR of all of its elements is at least k. ...
Minimum Array End You are given two integers n and x. You have to construct an array of positive integers nums of size n where for every 0 <= i < n - 1, nums[i + 1] is greater than nums[i],...
Maximum XOR for Each Query You are given a sorted array nums of n non-negative integers and an integer maximumBit. You want to perform the following query n times: Find a non-negative integer k ...
Largest Combination With Bitwise AND Greater Than Zero The bitwise AND of an array nums is the bitwise AND of all integers in nums. For example, for nums = [1, 5, 3], the bitwise AND is equal to...
Find if Array Can Be Sorted You are given a 0-indexed array of positive integers nums. In one operation, you can swap any two adjacent elements if they have the same number of set bits. You are ...
Minimum Number of Changes to Make Binary String Beautiful You are given a 0-indexed binary string s having an even length. A string is beautiful if it’s possible to partition it into one or more...