[LeetCode] 2594. Minimum Time to Repair Cars (Python)
·
알고리즘/LeetCode
난이도: MediumProblem Description You are given an integer array ranks representing the ranks of some mechanics.ranksi is the rank of the ith mechanic.  A mechanic with a rank r can repair n cars in r * n2 minutes. You are also given an integer cars representing the total number of cars waiting in the garage to be repaired. Return the minimum time taken to repair all the cars. Note: All the mechani..
[LeetCode] 2226. Maximum Candies Allocated to K Children (Python)
·
알고리즘/LeetCode
난이도: MediumProblem Description You are given a 0-indexed integer array candies. Each element in the array denotes a pile of candies of size candies[i]. You can divide each pile into any number of sub piles, but you cannot merge two piles together. You are also given an integer k. You should allocate piles of candies to k children such that each child gets the same number of candies. Each child c..
[LeetCode] 2529. Maximum Count of Positive Integer and Negative Integer (Python)
·
알고리즘/LeetCode
난이도: EasyProblem Description Given an array nums sorted in non-decreasing order, return the maximum between the number of positive integers and the number of negative integers.In other words, if the number of positive integers in nums is pos and the number of negative integers is neg, then return the maximum of pos and neg.Note that 0 is neither positive nor negative. Problem ExampleExample 1:In..
[LeetCode] 2779. Maximum Beauty of an Array After Applying Operation (Python)
·
알고리즘/LeetCode
난이도: Medium문제 설명You are given a 0-indexed array nums and a non-negative integer k.In one operation, you can do the following:Choose an index i that hasn't been chosen before from the range [0, nums.length - 1].Replace nums[i] with any integer from the range [nums[i] - k, nums[i] + k].The beauty of the array is the length of the longest subsequence consisting of equal elements.Return the maximum ..
[LeetCode] 3152. Special Array II (Python)
·
알고리즘/LeetCode
난이도: Medium 문제 설명An array is considered special if every pair of its adjacent elements contains two numbers with different parity. You are given an array of integer nums and a 2D integer matrix queries, where for queries[i] = [from_i, to_i] your task is to check that subarray nums[from_i..to_i] is special or not. Return an array of booleans answer such that answer[i] is true if nums[from_i..to_i..
[LeetCode] 2054. Two Best Non-Overlapping Events (Python)
·
알고리즘/LeetCode
난이도: Medium 문제 설명You are given a 0-indexed 2D integer array of events where events[i] = [startTime_i, endTime_i, value_i]. The ith event starts at startTime_i and ends at endTime_i, and if you attend this event, you will receive a value of value_i. You can choose at most two non-overlapping events to attend such that the sum of their values is maximized. Return this maximum sum. Note that the st..