Showing 3 of 14 questions
You're given two integer arrays. Modify the arrays with a series of swaps to make them unequal at every index, minimizing the total cost of those swaps. Find that minimum cost.
#1. Minimum Total Cost to Make Arrays Unequal
You're given items with prices and beauty values, and a list of queries representing price limits. For each query, find the item with the highest beauty value whose price is within the limit.
#2. Most Beautiful Item for Each Query
You are given a list of events with start times, end times, and values. Find the two non-overlapping events that maximize the sum of their values.
#3. Two Best Non-Overlapping Events
Page 1 of 1 · 14 total