All Posts
Leetcode 2059: Minimum Operations to Convert Number
You are given a 0-indexed integer array nums, containing distinct numbers, an integer start, and an integer goal. There is an integer x, initially set to start, and you need to transform x into goal by repeatedly performing operations. You can use any number from the array nums in the following ways: x + nums[i], x - nums[i], or x ^ nums[i] (bitwise-XOR). You can perform each operation any number of times in any order. If the resulting number goes outside the range 0 <= x <= 1000, no further operations can be performed. The task is to determine the minimum number of operations required to convert x from start to goal, or return -1 if it is not possible.
Leetcode 2064: Minimized Maximum of Products Distributed to Any Store
You are given a number n representing the number of retail stores and an array of integers quantities. Each quantity[i] represents the number of products of the i-th product type available. The task is to distribute all the products to the stores in such a way that no store gets more than one product type, but may receive any quantity of that type. The goal is to minimize the maximum number of products assigned to any store. Return the smallest possible value of this maximum number of products assigned to a store.
Leetcode 2070: Most Beautiful Item for Each Query
You are given a list of items, where each item has a price and a beauty score. You are also given a list of price queries. For each query, find the maximum beauty of an item with a price less than or equal to the query price. If no such item exists, return 0.
Leetcode 2073: Time Needed to Buy Tickets
You are given a queue of n people, where each person wants to buy a specific number of tickets. The task is to determine the time taken for the person at index k to finish buying all their tickets.
Leetcode 2079: Watering Plants
You need to water n plants arranged in a row. Starting at the river, you water the plants in order, refilling your watering can when it runs out. The goal is to determine the total number of steps to water all the plants.
Leetcode 2080: Range Frequency Queries
Design a data structure that allows you to efficiently find the frequency of a given value in a subarray. Implement the class RangeFreqQuery with the following methods:
RangeFreqQuery(int[] arr)initializes the data structure.int query(int left, int right, int value)returns the frequency ofvaluein the subarray fromlefttoright.