Problem Description You are given a 0-indexed array of strings nums, where each string is of equal length and consists of only digits. You are also given a 0-indexed 2D integer array queries where queries[i] = [ki, trimi]. For each queries[i], you need to: Trim each number in nums

Problem Description Given a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending order. An integer a is closer to x than an integer b if: |a - x| < |b -

Problem Description You are given a 0-indexed integer array nums, and an integer k. You are allowed to perform some operations on nums, where in a single operation, you can: Select the two smallest integers x and y from nums. Remove x and y from nums. Insert (min(x, y)

Problem Description You are given an array of events where events[i] = [startDay i, endDay i]. Every event i starts at startDay i and ends at endDay i. You can attend an event i at any day d where startTime i <= d <= endTime i. You can only attend

Problem Description There is a special kind of apple tree that grows apples every day for n days. On the ith day, the tree grows apples[i] apples that will rot after days[i] days, meaning they become rotten on day i + days[i] and can no longer be eaten.

Problem Description You are given two 0-indexed integer arrays servers and tasks of lengths n and m respectively. servers[i] is the weight of the i th server, and tasks[j] is the time needed to process the j th task in seconds. Tasks are assigned to the servers using

Problem Description The problem involves tracking the frequency of IDs in a collection that changes over time. You have two integer arrays, nums and freq, of equal length n. Each element in nums represents an ID, and the corresponding element in freq indicates how many times that ID should be

Problem Description You are given a 0-indexed integer array costs where costs[i] is the cost of hiring the ith worker. You are also given two integers k and candidates. We want to hire exactly k workers according to the following rules: You will run k sessions and hire exactly

Problem Description You are given two string arrays creators and ids, and an integer array views, all of length n. The i th video on a platform was created by creators[i], has an id of ids[i], and has views[i] views. The popularity of a creator is the

Problem Description You are given n tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTime i, processingTime i]means that the i t task will be available to process at enqueueTime i and will take processingTime i to finish processing.