Solved! Leetcode 2462. Total Cost to Hire K Workers 1

source: https://leetcode.com/problems/total-cost-to-hire-k-workers/description/ Total Cost to Hire K Workers Table of ContentsTotal Cost to Hire K WorkersDescriptionExample 1:Example 2:Constraints:Solution 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 ...

Solved! Leetcode 253. Meeting Rooms II

source: https://leetcode.com/problems/meeting-rooms-ii/description/ Meeting Rooms II Given an array of meeting time intervals intervals where intervals[i] = [starti, endi], return the minimum number of conference rooms required. Example 1: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2 Example 2: Input: intervals = [[7,10],[2,4]] Output: 1 Constraints: 1 <= intervals.length <= 104 0 <= starti < endi <= 106 ...

Solved! Leetcode 1046. Last Stone Weight

source: https://leetcode.com/problems/last-stone-weight/description/ Last Stone Weight You are given an array of integers stones where stones[i] is the weight of the ith stone. We are playing a game with the stones. On each turn, we choose the heaviest two stones and smash them together. Suppose the heaviest two stones have weights x and y with x ...

Leetcode 1834: Single-Threaded CPU

You are given n​​​​​​ tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means that the i​​​​​​th​​​​ task will be available to process at enqueueTimei and will take processingTimeito finish processing. You have a single-threaded CPU that can process at most one task at a time and will act in the following way: If the CPU is idle ...